Quick Sort

What is Quick sort?

The quick sort algorithm is a divide and conquer sorting method. It works by selecting a value called a pivot and rearranging the other items into two partitions based on whether they are less than or greater than the pivot.

The warm-up exercise above demonstrates the Hoare partition scheme, which was developed by Tony Hoare. It is important to note that this is only one method of implementing Quick Sort; other variations like the Lomuto partition scheme also exist.