Anonymous user
Compare sorting algorithms' performance: Difference between revisions
Compare sorting algorithms' performance (view source)
Revision as of 18:56, 24 December 2007
, 16 years ago→Figures: log2( time in microseconds ) vs. log2( sequence length ): + added description of sorting functions
mNo edit summary |
(→Figures: log2( time in microseconds ) vs. log2( sequence length ): + added description of sorting functions) |
||
Line 139:
</code>
===Figures: log2( time in microseconds ) vs. log2( sequence length )===
1 <= N <=
sort_functions = [
builtinsort, # see implementation above
insertion_sort, # see [[Insertion sort]]
insertion_sort_lowb, # ''insertion_sort'', where sequential search is replaced
# by lower_bound() function
qsort, # see [[Quicksort]]
qsortranlc, # ''qsort'' with randomly choosen ''pivot''
# and the filtering via list comprehension
qsortranpart, # ''qsortranlc'' with filtering via ''partition'' function
qsortranpartis, # ''qsortranpart'', where for a small input sequence lengths
] # ''insertion_sort'' is called
====ones====
[http://bahus.3ka.mipt.ru/gallery/data/public/24.12.07/energy_104231.png ones.png] (143KiB)
| |||