Time Complexity of Common Sorting Algorithms
Initializing live version
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
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
 Wikipedia. "Time Complexity." (Feb 9, 2016) en.wikipedia.org/wiki/Time_complexity.