Techniques for arranging elements in a specific order, such as bubble sort, quicksort, and mergesort.
Methods for finding an element in a data structure, including linear search and binary search.
Algorithms to process graphs, including Dijkstra's shortest path and depth-first search (DFS).
A method for solving complex problems by breaking them down into simpler subproblems.
Algorithms that make the best choice at each step, aiming for a locally optimal solution.