Time Complexity of Common Sorting Algorithms

Requires a Wolfram Notebook System

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

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

This Demonstration shows the average Big-O complexity of some common sorting algorithms as the number of elements in the unsorted list increases. Most sorting algorithms run in or time. Bogosort (randomize the unsorted list and check if it is sorted) is included for comparison.

Contributed by: Edric Xiang (February 2016)
Open content licensed under CC BY-NC-SA




[1] Wikipedia. "Time Complexity." (Feb 9, 2016) en.wikipedia.org/wiki/Time_complexity.

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.