Quicksort versus Selection Sort

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Quicksort, the most widely used sorting algorithm, is contrasted with the less efficient selection sort.


Quicksort starts by picking an element, called a pivot (white), from the list. The list is reordered so that all elements (red) that are less than the pivot are put before the pivot and all elements (blue) greater than or equal to the pivot are put after it. After this partitioning, the pivot is in its final position. This partitioning operation is recursively applied to the resulting sublists.

Selection sort first finds the minimum element in the list. That element is swapped with the first element. This procedure is repeated starting with the second position, and so on.


Contributed by: Jay Warendorff (March 2011)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.