Algorithms (Sedgewick and Wayne) | Computer Science Fundamentals | Oh My Learning

01 Union-find and connectivity modeling 7 min read junior drafted 02 Algorithm analysis and cost models 7 min read junior drafted 03 Stacks, queues, and linked-list implementations 7 min read junior drafted 04 Elementary sorting (selection, insertion, shellsort) 8 min read junior drafted 05 Mergesort and quicksort in practice 8 min read mid drafted 06 Priority queues and heapsort 8 min read mid drafted 07 Symbol tables with binary search trees 7 min read mid drafted 08 Balanced search trees (red-black BSTs) 8 min read mid drafted 09 Hash tables (separate chaining and linear probing) 7 min read junior drafted 10 Undirected and directed graph fundamentals 7 min read mid drafted 11 Minimum spanning trees and shortest paths 8 min read mid drafted 12 Directed acyclic graphs and topological order 7 min read mid drafted 13 Tries and substring search algorithms 9 min read mid drafted 14 Data compression (Huffman and LZW) 8 min read senior drafted