A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them.

A simple comparison-based sorting algorithm that repeatedly selects the minimum element from the unsorted part and swaps it with the first unsorted element.

A simple sorting algorithm that builds the final sorted array one item at a time.

A divide-and-conquer algorithm that splits the array into smaller sub-arrays and merges them back together in sorted order.

A divide-and-conquer algorithm that selects a 'pivot' element and partitions the array around it.

A comparison-based sorting algorithm that builds a heap structure and then sorts the array.

A non-comparative sorting algorithm that sorts numbers by processing individual digits.

A sorting algorithm that divides the data into several buckets and then sorts each bucket.