Foundations & Asymptotic Analysis
Recommended next 1. RAM Model, Pseudocode, and Big-O
← Swipe to explore the full concept map →
RAM Model, Pseudocode, and Big-O appears earlier in the syllabus and supports Merge-Sort: Algorithm & Analysis. Merge-Sort: Algorithm & Analysis appears earlier in the syllabus and supports Quick-Select & Median of Medians. Quick-Select & Median of Medians appears earlier in the syllabus and supports Chaining, Open Addressing & Universal Hashing. Chaining, Open Addressing & Universal Hashing appears earlier in the syllabus and supports AVL Trees: Rotations & Height Maintenance. AVL Trees: Rotations & Height Maintenance appears earlier in the syllabus and supports Adjacency Lists vs. Matrices & BFS. Adjacency Lists vs. Matrices & BFS appears earlier in the syllabus and supports Dijkstra: Correctness & Binary-Heap Implementation. Dijkstra: Correctness & Binary-Heap Implementation appears earlier in the syllabus and supports Floyd-Warshall: Dynamic Programming over Subsets. Floyd-Warshall: Dynamic Programming over Subsets appears earlier in the syllabus and supports Activity Selection & Greedy Exchange Proofs. Activity Selection & Greedy Exchange Proofs appears earlier in the syllabus and supports Max-Flow Min-Cut & Edmonds-Karp. prerequisite 1 current RAM Model, Pseudocode, and Big-O 2 checks 3 cards 2 next Merge-Sort: Algorithm & Analysis 2 checks 3 cards 3 ready Quick-Select & Median of Medians 2 checks 3 cards 4 ready Chaining, Open Addressing & Universal Hashing 2 checks 3 cards 5 ready AVL Trees: Rotations & Height Maintenance 2 checks 3 cards 6 ready Adjacency Lists vs. Matrices & BFS 2 checks 3 cards 7 ready Dijkstra: Correctness & Binary-Heap Implement... 2 checks 3 cards 8 ready Floyd-Warshall: Dynamic Programming over Subsets 2 checks 3 cards 9 ready Activity Selection & Greedy Exchange Proofs 2 checks 3 cards 10 ready Max-Flow Min-Cut & Edmonds-Karp 2 checks 3 cards prerequisite relationship
RAM Model, Pseudocode, and Big-O -> Merge-Sort: Algorithm & Analysis
RAM Model, Pseudocode, and Big-O appears earlier in the syllabus and supports Merge-Sort: Algorithm & Analysis.
Unit 1 Foundations & Asymptotic Analysis Unit 2 Divide-and-Conquer Sorting Unit 3 Heaps, Priority Queues & Selection Unit 4 Hash Tables & Dictionary ADT Unit 5 Binary Search Trees & Balancing Unit 6 Graph Representations & Traversals Unit 7 Shortest-Path Algorithms Unit 8 All-Pairs Shortest Paths & DP on Graphs Unit 9 Greedy Algorithms & Exchange Arguments Unit 10 Network Flow & Introduction to NP-Completeness