# Introduction QuickSort is a Divide-and-Conquer sorting algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. QuickSort's average case complexity is O(n log n). It should be noted that QuickSort is not a stable sort, that is, the relative positions of equal sort items may not be preserved.
Click the virtual machine below to start practicing