Bubble Sort →
The simplest sorting algorithm with very high time complexity. Repeatedly swaps adjacent elements.
Selection Sort →
A slight improvement to bubble sort that finds the smallest, unsorted element and puts it at the beginning.
Heap Sort →
An improved selection sort that builds an array-backed max heap to quickly find the largest element.
Quick Sort →
Picks a pivot and partitions the array around the pivot point. It is generally much faster than heap sort.