Time Complexity of Common Sorting Algorithms
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.
 Wikipedia. "Time Complexity." (Feb 9, 2016) en.wikipedia.org/wiki/Time_complexity.