Bubble Sort

Repeatedly swap adjacent elements that are out of order

Selection Sort

Find the minimum in the unsorted portion and place it at the front

Insertion Sort

Build a sorted prefix by inserting each element into its correct position

Quick Sort

Partition around a pivot, then recursively sort each side

Merge Sort

Divide in half, sort each half, merge — guaranteed O(n log n)