Foundational Sorting Algorithms
Sorting is one of the most thoroughly studied problems in Computer Science. At its core, given a structured set of $n$ elements $[a1, a2, a3, \dots, an]$ and a strict total order relation ($\le$), the objective of a sorting algorithm is to rearrange the elements into an increasingly ordered sequence.