Sorting Algorithms

• Bubble sort
• Merge sort
• Quick sort
• Heap sort

Search Algorithms

• Linear Search
• Binary Search
• BFS (Breadth First Search)
• DFS (Depth First Search)

Recursion Algorithms

Recursion is a problem-solving technique in which the solution is dependant on solutions to smaller instances of the same problem.

Divide and Conquer

Divide: The original problem is divided into sub problems
Conquer: Solve each sub problem one at a time, recursively.
Recursively: Put the solutions to the sub problems together to get the solution to the whole problem

Hashing Algorithms

Hashing is a technique or process that uses a hash function to make keys and values into a hash table.

Dynamic Programming

Dynamic Programming is nothing but recursion with memoization.
It involves calculating and storing values that can be later accessed to solve sub problems that occur again

That's it!! #HappyCoding