Everything from the algorithms course, on one canvas. The order is the order it was taught in, so it goes from Big O up to the graph algorithms.
Most of these only made sense to me once I drew the steps out, so the canvas is worth more here than the table below.
Drawings
Topics
| Topic | Items |
|---|---|
| Foundations | Big O notation, recursion |
| Sorting | Merge sort, quick sort, radix sort, count sort |
| Heap and PQ | Binary trees, depth, height, min heap, max heap, build heap, heapify, heapsort, insert, extract max |
| Huffman coding | Encoding, constructing the code, minimize total bits |
| Dynamic programming | 0/1 knapsack (top-down memo, bottom-up), fractional knapsack |
| Divide and conquer | Matrix multiplication (Strassen) |
| Graph traversal | BFS (shortest path), DFS |
| Shortest path | Dijkstra, Bellman-Ford, Floyd-Warshall |
| Minimum spanning tree | Prim, Kruskal |
Resources
The links I actually used, pulled straight off the canvas. One row per video.
| Topic | Resource |
|---|---|
| Asymptotic Notations | Go to link |
| Asymptotic Notations | Go to link |
| Little o | Go to link |
| Little Omega | Go to link |
| Recurrence Relations | Go to link |
| Recurrence Relation | Go to link |
| Masters Theorem | Go to link |
| Merge Sort | Go to link |
| Sorting | Go to link |
| Quick Sort | Go to link |
| Radix Sort Algorithm | Go to link |
| Counting Sort | Go to link |
| Knapsack Problem (heap intro) | Go to link |
| 0/1 Knapsack | Go to link |
| Longest Common Subsequence | Go to link |
| Longest Common Subsequence | Go to link |
| Matrix Chain Multiplication | Go to link |
| Matrix Chain Multiplication | Go to link |
| Huffman Coding | Go to link |
| Breadth First Search | Go to link |
| Dijkstra’s Shortest Path | Go to link |
| Dijkstra Algorithm | Go to link |
| Bellman Ford Algorithm | Go to link |
| All Pairs Shortest | Go to link |
| Prims and Kruskals | Go to link |