Compare sorting algorithms' performance: Difference between revisions
Compare sorting algorithms' performance (view source)
Revision as of 19:51, 28 March 2016
, 8 years ago→{{header|Go}}: improve conclusions
m (→{{header|Go}}: credit plotting library) |
m (→{{header|Go}}: improve conclusions) |
||
Line 1,217:
Step 4, conclusions about relative performance of the sorting routines made based on the plots.
The plots show differences in best and worse case performance for the various data sets. Bubble and insertion sorts show very good best case performance with all one and ascending sequences, beating quicksort. Quicksort shows best case performance with the ascending sequence but worst case performance with the all one sequence
On random data (triangles) insertion and bubble sort show worse performance than quicksort.
<br clear=all>
| |||