Implementations of foundational algorithms and data structures in Computer Science
make
./main
- Review foundational algorithms and data structures
- Develop skills to build efficient, maintainable, and secure C++ code
The first collection of algorithms and data structures I plan to implement are from the infamous "Introduction to Algorithms" (3rd edition) by Thomas H. Cormen, Charles E. Leiserson, Ronald Rivest, Clifford Stein (also known as CLRS).
Here's a TODO list tracking how much I've implemented so far:
- Insertion sort
- Heapsort
- Quicksort
- Randomized Quick Sort
- Counting sort
- Radix sort
- Bucket sort
- Maximum
- Minimum
- Randomized Select
- Stack
- Queue
- Linked List
- Pointer
- Direct Access Table
- Hash Table
- Binary Search Tree
- Reb-Black Tree
- Order-Stastic Tree
- Interval Tree
- Rod cutting
- Matrix Multiplication (chained)
- Longest common subsequence
- Optimal Binary Search Tree
... to be continued...