Algorithms

An algorithm is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or to perform a computation. (Source: Wikipedia)

B - Beginner, A - Advanced

Algorithms by Topic

Sorting

• B Bubble Sort [Code]
• B Bucket Sort [Code]
• B Counting Sort [Code]
• B Heap Sort [Code]
• B Insertion Sort [Code]
• B Merge Sort [Code]
• B Quicksort Sort [Code]
• B Radix Sort [Code]
• B Selection Sort [Code]
• B Shell Sort [Code]
• B Tim Sort

Search

• B Binary Search [Code]
• B Jump Search [Code]
• B Linear Search [Code]

Pattern

• A Boyer Moore [Code]
• A Knuth Morris Pratt [Code]
• B Naive Algorithm [Code]
• A Rabin Karp [Code]
• A Z algorithm [Code]

Tree

• B Breadth first search [Code]
• B Depth first search [Code]
• B Is balanced tree [Code]
• B Is complete tree [Code]
• B Is full tree [Code]
• B Is perfect tree [Code]

Graph

• A Articulation points [Code]

• A Bellman-Ford algorithm [Code]

• B Breadth first search [Code]

• A Bridges [Code]

• B Depth first search [Code]

• A Detect cycle [Code]

• A Dijkstra algorithm [Code]

• A Floyd-Warshall algorithm [Code]

• A Hamiltonian cycle [Code]

• B Kruskal's algorithm [Code]

• A Prim's Algorithm [Code]

• A Strongly connected components [Code]

• A Topological sort [Code]

• A Travelling salesman problem

  • Hamiltonian cycle [Code]
  • Backtracking [Code]
  • Branch & Bound [Code]

• A Eulerian Path: Fleury's algorithm

• A A* search algorithm [Code]

Math

• B Combinations
  • With repetitions [Code]
  • Without repetitions [Code]
• B Permutations
  • With repetitions [Code]
  • Without repetitions [Code]
• B Factorial [Code]

Other

• A Knapsack problem [Code]
• Hanoi tower
• Knight tour
• N-queens
• Square matrix rotation