Recursive
Merge Sort
A divide-and-conquer sorting technique that splits the array into halves, recursively sorts each half, and then merges the sorted halves.
- Time complexity is Linearithmic, i.e. O(n log(n))
- Space complexity is Linear, i.e. O(n)
Quicksort
Quick sort is a divide-and-conquer sorting algorithm that selects a “pivot” element from an array, partitions the remaining elements into two sub-arrays (elements less than the pivot and elements greater than the pivot), and then recursively sorts the sub-arrays.