An efficient sort algorithm, described by C.A.R. Hoare in 1962, in which the essential strategy is to “divide and conquer.” A quicksort begins by scanning the list to be sorted for a median value. This value, called the pivot, is then moved to its final position in the list. Next, all items in the list whose values are less than the pivot value are moved to one side of the list, and the items with values greater than the pivot value are moved to the other side. Each resulting side is sorted the same way, until a fully sorted list results. See also sort algorithm. Compare bubble sort, insertion sort, merge sort.