The purpose of this repository is to implement common algorithms and data structures from scratch to get a deep understanding of the inner-workings. Each algorithm/data-structure is accompanied by a beautiful set of tests written in Rspec.
- Binary Search
- Bubble Sort
- Dijkstras
- Heap Sort
- Merge Sort
- Quick Sort (Sort In Place)
- Topological Sort (Khan and Tarjan implementation)
- Breadth First Search
- Depth First Search
- Array (Amortized w/Ring Buffer)
- Hash Map
- Priority Map
- Binary Min Heap
- Binary Search Tree
- Linked List
- LRU Cache
- Queue
- Stack
- Graph