Sorting algorithms….

Here are the results for the faster of the 11 sorting algorithms.

The standard template library algorithm takes a commanding lead.  It is interesting to note that all sorts follow a predictable curve, except the shell sort which takes an unpredicted leap above the merge sort algorithm.

For the partially sorted list, the results are very similar to the last graph.  The shell sort still takes a large hit once a million elements are sorted, and the STL algorithm still beats the competition.

Here, the shell sort takes another interesting turn in that it improves in efficiency and follows the same curve as the BST sort.

The shell sort makes yet another jump in efficiency and now beats out the radix sort by a small margin.  It is interesting to note that the STL sort never took longer than 1 second to complete, and all of the other algorithms except the shell sort fell into the same order of efficiency for each test.