<aside> <img src="https://super.so/icon/dark/pen-tool.svg" alt="https://super.so/icon/dark/pen-tool.svg" width="40px" /> All pages are designed to have minimal dependency on other ones so you can jump around. Except the summaries because they use the previous sections as examples.

Update Log as of October 1, 2022

WIP = Work In Progress

All code blocks are pseudocode unless explicitly stated even though the blocks will say C on the top left.

</aside>

Symbols & Notations

Textbooks

Chapters for 122A

https://github.com/tomli380576/ECS122A-Algorithms-python-implementation

Algorithm Analysis Techniques

Substitution, Lower Order Term Examples

Recurrence Tree Examples

Masters Theorem

Recursion and Dynamic Programming

Recursion: Divide & Conquer

◈ Recursive Backtracking

Dynamic Programming 1. Making Decisions

❖ Dynamic Programming 2. Subtle Subproblems

Greedy

Greedy Algorithms

Graph Traversal

◈ The Only Graph Traversal Algorithm

MST