Exercises for Algorithms, by Princeton University on Coursera
📕 Textbook: Algorithms, 4th Edition
- Week 1 - Percolation
- Week 2 - Deque and Randomized Queue
- Week 3 - Pattern Recognition
- Week 4 - 8 Puzzle
- Week 5 - Kd-Trees
- Week 1 - WordNet
- Week 2 - Seam Carving
- Week 3 - Baseball Elimination
- Week 4 - Boggle
- Week 5 - Burrows-Wheeler
| General Sorts | String Sorts |
|---|---|
| Bubble Sort | LSD |
| Heapsort | MSD |
| Insertion Sort | 3-way Radix Quicksort |
| Merge Sort | |
| Quicksort | |
| Selection Sort | |
| Shell Sort |
| Data Structures | Related Implementation & Algorithms |
|---|---|
| Union Find | Quick-Find UF Quick-Union UF Weighted Quick Union UF Quick Union with Path Compression |
| List | Array List Linked List |
| Stacks | Resizing Array Stack Linked Stack |
| Queues | FIFO Queue Dequeue |
| Priority Queue | Min Queue Max Queue |
| MaxFlow-MinCut | Ford-Fulkerson Algorithm |
| Trie | Ternary Search Trie |
| String Search | Brute Force Knuth-Morris-Pratt Boyer Moore Rabin-Karp Fingerprint Search |
Further Reading
- Data Structures and Algorithm Analysis in Java, 3rd Edition, Mark Allen Weiss