Anonymous user
Compare sorting algorithms' performance: Difference between revisions
Compare sorting algorithms' performance (view source)
Revision as of 08:35, 24 December 2007
, 16 years agono edit summary
m (→Figures: log2( time in microseconds ) vs. log2( sequence length ): fix formatting) |
mNo edit summary |
||
Line 2:
Measure a relative performance of sorting algorithms implementations.
Plot '''execution time vs. input sequence length''' dependencies for various implementation of sorting algorithm and different input sequence types ([[http://www.rosettacode.org/rosettacode/w/index.php?title=Measure_relative_performance_of_sorting_algorithms_implementations#Figures:_log2.28_time_in_microseconds_.29_vs._log2.28_sequence_length_.29 example figures]]).
Consider three type of input sequences:
| |||