- Python
- C (WIP)
- C++ (WIP)
- Rust (WIP)
In sort.ipynb you can find 10 sorting algorithms. Some of them have several implementations. You'll find:
- Merge sort
- Quick sort
- Selection sort
- Bubble sort
- Insertion sort
- Shell sort
- Heap sort
- Bucket sort
- Stalin sort
- Bogo sort
In search.ipynb you can find 7 searching algorithms. Hash-based have several implementations. You'll find:
- Linear search
- Binary search
- Binary search tree
- Fibonacci search
- Interpolation search
- Bloom filter
- Hash-based search
In graph.ipynb you can find 5 graph algorithms. You'll find:
- Breadth First Search
- Depth First Search
- Levit
- Dijkstra
- Bellman-Ford