Advanced Sorting Algorithms

We have the following advanced sorting algorithms:

• Quicksort - Sorts an array with a divide-and-conquer approach.
• Merge Sort - Uses a bottom-up approach to sort arrays.
• Heap Sort - Sorts an array using a heap data structure.
• Radix Sort - Sorts integers using a radix tree.

See optimizations for each algorithm.

Quicksort

Quicksort is a divide-and-conquer algorithm.