Implementation of data structures and algorithms introduced in MIT OCW 6006 and 6046 in ReasonML.
Currently focusing on data structures and algorithms introduced in 6006
Checkout the contribution guidelines.
| Alg / DS | Lecture | Implementation |
|---|---|---|
| Insertion Sort | Lec 3 | sort / InsertionSort.re |
| Merge Sort | Lec 3 | sort / MergeSort.re |
| Heaps | Lec 4 | basic / Heap.re |
| AVL Trees | Lec 6 | |
| Counting Sort | Lec 7 | sort / integer_sort / CountingSort.re |
| Radix Sort | Lec 7 | sort / integer_sort / RadixSort.re |
| Hashing with Chaining | Lec 8 | hashing / HashtblWithChaining.re |
| Table Doubling | Lec 9 | basic / DynamicArray.re |
| Rolling Hash | Lec 9 | hashing / RollingHash.re |
| Karp-Rabin | Lec 9 | hashing / KarpRabin.re |
| Hashing with Open Addressing | Lec 10 | hashing / HashtblWithOpenAddressing.re |
| Karatsuba Multiplication | Lec 11 | |
| Breadth-First Search (BFS) | Lec 13 | graphs / BreadthFirstSearch.re |
| Depth-First Search (DFS) | Lec 14 | graphs / DepthFirstSearch.re |
| Topological Sort | Lec 14 | |
| Dijkstra | Lec 16 | |
| Bellman-Ford | Lec 17 |