Bubble sort repeatedly swaps adjacent out-of-order elements until sorted.

Merge sort divides the array in half, sorts each half, and then merges the sorted halves.

Insertion sort builds the sorted array one item at a time, inserting each new item into its proper place.

Selection sort repeatedly selects the smallest remaining element and swaps it with the current element.

Quick sort selects a pivot element and partitions the array around the pivot, sorting the elements.

Heap sort converts the array into a heap, then repeatedly extracts the maximum element to sort the array.