Sorting algorithms – the result!
I did a blog post last week that explained that I would be doing some tests to see how efficient sorting algorithms are. I have now done tests with a few sorting algorithms listed in the table above. If you would like to view the full results, I have a presentation here as well. If you would like my code for the bubble sort, quicksort, count sort or bogosort, download either of the two files below:
The end result of the study was that the Quicksort tends to be more efficient when used on larger data sets (because it does more comparison on smaller data sets), however the count sort is considerably more efficient, even though the version I wrote only supports positive integers.
