Techniques to arrange data in a specific order like Quick Sort, Merge Sort, Bubble Sort. And methods to locate specific data within a structure like Binary Search, Linear Search.
Algorithms used to process and analyze graph data structures (e.g., BFS, DFS, Dijkstra's Algorithm).
Techniques for solving problems by breaking them down into overlapping subproblems (e.g., Knapsack Problem, Longest Common Subsequence).
Strategies that split problems into smaller subproblems, solve them independently, and combine the results (e.g., Merge Sort, Quick Sort).
]Algorithms that make the locally optimal choice at each step (e.g., Kruskal's Algorithm, Prim's Algorithm).
Simple searching techniques that iterate through elements sequentially.