Stein

Data Structures and Algorithms implementation in JavaScript with explanations. (Implementation in Python has also been added by @anantkaushik)

Topics covered:

• Insertion Sort
• Quick Sort
• Merge Sort
• Dutch National Flag Problem
• Quick Union/Find
  • Quick Find
  • Quick Union
  • Quick Union Weighted
  • Quick Union (Weighted/Unweighted) with Path Compression
• Priority Queues
  • Binary Heaps
  • Heap Sort
• Linked Lists
• Trees
  • Binary Search Tree
  • Red Black Tree
  • AVL Tree
• Graphs
  • Graph API's
  • Depth First Search (DFS)
  • Breadth First Search (BFS)
  • Connected Components
  • Topological Sort
  • Strong Components
  • Dijkstra's Algorithm
  • Ford Fulkerson
  • Minimum Spanning Trees (MST)
  • Greedy Algorithms
    • Kruskal's Algorithm
    • Prim's Algorithm
• Radix Sort
  • LSD
  • MSD
  • 3-way Radix Quick Sort
• Tries
  • Ternary Search Tries
  • R-way Tries
• Strings
  • Rabin Karp
  • Knuth Morris
  • Boyer Moore

Why this repository?

This is mostly for my personal learning and future references, but anyone can use it for learning purpose. 🍻