Algorithm Design article

[jainaman224]

We are aiming to write basic algorithms that are

• Sorting
  • Bubble Sort
  • Selection Sort added ternary search and updated binary search #25
  • Insertion Sort (assigned to @swatinirwal)
  • Merge Sort
  • Heap Sort
  • Quick Sort
  • Counting Sort (assigned to @ayushin78) Added Counting Sort #20
  • Radix Sort
  • Shell Sort
  • Bucket Sort
  • Randomized Quick Sort
  • Merge Sort with Insertion Sort
• Searching
  • Linear Search
  • Binary Search added ternary search and updated binary search #25
  • Ternary Search
  • Interpolation Search
• Graph
  • Depth First Search
  • Breadth First Search
  • Prims Algorithm
  • Dijkstra Algorithm
  • Floyd Warshall Algorithm
  • Topological Sort
  • Kruskal Algorithm
  • Strongly Connected Components
  • Bellman - Ford Algorithm
• Strings
  • Naive Matching
  • Knuth Morris Pratt
  • Z algorithm
  • Rabin Karp
• Dynamic Programming
  • Rod Cutting
  • Knapsack
  • Matrix Chain Multiplication
  • Longest Common subsequence
  • Kadane Algorithm
• Greedy
  • Activity Selection
  • Huffman codes
• Number Theory
  • Modular Arithmetic
  • Fermat's theorem
  • Sieve of Eratosthenes
  • Logarithmic Exponentiation
  • Euclidean method for Greatest common divisor
  • Chinese Remainder Theorem
• Game Theory
  • Nim Game
  • Grundy numbers
  • Sprague Grundy Theorem