Skip to content

Latest commit

 

History

History
41 lines (36 loc) · 1.04 KB

README.md

File metadata and controls

41 lines (36 loc) · 1.04 KB
Raw

License: MIT

Hello friends 👋

This is my git repo with Data structures and algorithms. Here you can find code in:

  • Python
  • C (WIP)
  • C++ (WIP)
  • Rust (WIP)

📒 Sort (only Python for now)

In sort.ipynb you can find 10 sorting algorithms. Some of them have several implementations. You'll find:

  1. Merge sort
  2. Quick sort
  3. Selection sort
  4. Bubble sort
  5. Insertion sort
  6. Shell sort
  7. Heap sort
  8. Bucket sort
  9. Stalin sort
  10. Bogo sort

🔎 Search (only Python for now)

In search.ipynb you can find 7 searching algorithms. Hash-based have several implementations. You'll find:

  1. Linear search
  2. Binary search
  3. Binary search tree
  4. Fibonacci search
  5. Interpolation search
  6. Bloom filter
  7. Hash-based search

➡️ Graph.ipynb (only Python for now)

In graph.ipynb you can find 5 graph algorithms. You'll find:

  1. Breadth First Search
  2. Depth First Search
  3. Levit
  4. Dijkstra
  5. Bellman-Ford