Sorting

Organizing elements in a specific order, such as ascending or descending.

Searching

Finding the position or existence of a specific element within a collection.

1. Linear Search
2. Binary Search

Divide and Conquer

Breaking a problem into smaller sub-problems, solving each one, and combining the results.

1. Merge sort
2. Quick sort 3. Strassen’s Matrix Multiplication 4. Largest Sub Array Sum 5. Finding Maximum and Minimum

Greedy Approach

Making the locally optimal choice at each step with the hope of finding a global optimum.

1. Huffman Tree
2. Fractional Knapsack Problem 3. Prims Algorithm 4. Kruskals Algorithm

Dynamic Programming

Breaking problems into subproblems, solving each once, and storing solutions for future use to ensure an optimal solution.

1. Largest Common Subsequence

Backtracking

Exploring all possibilities by making choices, undoing them when necessary, and backtracking to find the best solution.

4. N Queens