Compare sorting algorithms' performance: Difference between revisions
Compare sorting algorithms' performance (view source)
Revision as of 02:41, 17 July 2018
, 5 years agono->not
(Added Kotlin) |
m (no->not) |
||
Line 2,018:
===Conclusions===
I knew bubblesort and insertion sort would be bad, but
(logarithmic scale helps, but is still not enough)
I had no idea that (these particular implementations of) quicksort and shellsort would be so bad on a sequence of all 1s.
| |||