Sorting Algorithms

A simple algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

Builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms.

An efficient, general-purpose, divide and conquer algorithm that splits lists to single elements and merges them in order.

A highly efficient sorting algorithm that partitions an array into smaller sub-arrays based on a pivot element.