Quick sort is one of the fastest sorting algorithms. It is a divide and conquer algorithm, so it divides the data to sort it. In a list, quick sort uses pivot values and partitions to sort the data.

---

Firstly, choose a pivot value. Then, go from the right and left of the pivot values to find the values that are higher and lower than the pivot. All the values that are higher than the pivot value go to the right of the pivot and the values that are less go to the left. Then recursively apply quicksort to each partitioned side to return the sorted list.