The quick sort algorithm sorts a list by partitioning the list and then recursively sorting the two partitions.

Name: The quick sort algorithm sorts a list by partitioning the list and then recursively sorting the two partitions.
Brand: Quizplus
Rating: 4.8 (42 reviews)

Question

Quizplus · Accepted Answer

Quick sort 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.

The Quick Sort Algorithm Sorts a List by Partitioning the List