Searching Algorithms
Sorting Algorithms
Bubble Sort
Compare adjacent elements and swap when needed.
Selection Sort
Pick the minimum from unsorted part and place it forward.
Insertion Sort
Insert each element into the correct position of sorted prefix.
Merge Sort
Divide recursively, then merge sorted halves.
Quick Sort
Partition around a pivot and recursively sort partitions.
Heap Sort
Build a max heap and extract the largest element repeatedly.
Radix Sort
Sort integers digit by digit using stable counting passes.