In the series, graphs showed execution time. Another way to view performance is by throughput — the number of elements/second that are processed (sorted). The following logarithmic graphs show performance of various sequential and parallel algorithms in elements/second. Keep in mind that several algorithms are hybrid, where Insertion Sort is combined with the main sorting algorithm, and is the reason for performance being nearly the same for the smallest array size. Note that the order of the algorithms is visible on these graphs, especially O(n2), where as the difference between O(nlgn) and O(dn) is smaller.
In all graphs the vertical axis is elements/second and the horizontal axis is size of the array being sorted. All measurements are for Intel i7 860 quad-core CPU (2.8 GHz).