Moscow Institute of Physics and Technology (MIPT) - Algorithms and Data Structures

There is implementation of algorithms and data structures from the course of master's degree program by MIPT

• Stack
• Linked List
• Sorting algorithms:
  • Bubble Sort
  • Selection Sort
  • Merge Sort
  • Counting Sort
  • Quick Sort
• Searching algorithms:
  • Binary Search
  • Ternary Search
• Hash Tables:
  • Separate chaining Hash Table
  • Open addressing Hash Table
• Graph traversal algorithms:
  • Depth-First Search
  • Breadth-First Search
• Bridge-finding algorithm
• Path finding algorithms
  • Dijkstra’s algorithm
  • Bellman–Ford algorithm
  • Floyd–Warshall algorithm
• Heaps
  • Binary Heap
  • Randomized Heap
• Treaps
  • Treap (Randomized Binary Search Tree)
  • Implicit Treap
• Disjoint Set
• Segment Tree
• Substring search algorithms:
  • Z-function
  • Knuth–Morris–Pratt algorithm
• Trie