Great algorithms are the poetry of computation — Francis Sullivan
TypeScript implementations of the Algorithms and Data Structures taught in Algorithms, 4th Edition, by Robert Sedgewick and Kevin Wayne of Princeton University.
Currently a Work-in-Progress.
- Union-Find: Quick-Find, Quick-Union, Weighted Quick-Union, and Weighted Quick-Union with Path Compression.
- Stacks and Queues: Stacks (linked list + array), Queues (linked list + array), and Deques.
- Elementary Sorts: Selection Sort, Insertion Sort, Shellsort, and Knuth Shuffle.
- Mergesort: Mergesort (top-down + bottom-up).
- Quicksort: Quicksort, Quick-select, and 3-way Quicksort.
- Priority Queues: Priority Queue, Binary Heap, and Heapsort.
- Elementary Symbol Tables:
- Big-O Cheat Sheet
- The Intuitive Guide to Data Structures And Algorithms
- A Gentle Introduction to Algorithm Complexity Analysis
All assignments, test data, sample code, and slides are the copyright of Robert Sedgewick and Kevin Wayne.
MIT