C++ Sorting Algorithms


See the link below to explore interactively the above graph in detail. As you scroll through the graph, individual performance data points are shown, with array size and run time in seconds for each of the C++ sorting algorithms:

Interactive Graph of Sorting Algorithms: Time vs. Array Size

Standard STL sort is able to sort 7.1 Million 32-bit integers per second, while STL heap sort can sort 3 Million. A Radix Sort (LSD) is able to sort 57.4 Million – 8X faster than STL sort and 19X faster than STL heap sort – but is not provided by STL.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s