Quick Sort

Quick sort is a fast sorting algorithm that partitions an array around a pivot and sorts the sub-arrays recursively. It has an average time complexity of 𝑂 ( 𝑛 log ⁡ 𝑛 ) O(nlogn).