Anonymous user
Compare sorting algorithms' performance: Difference between revisions
Compare sorting algorithms' performance (view source)
Revision as of 08:20, 24 December 2007
, 16 years agoadded couple of figures with results (links to images)
mNo edit summary |
(added couple of figures with results (links to images)) |
||
Line 28:
'''Interpreter:''' [[Python]] 2.5
[[Category:Python]]
===
def builtinsort(x):
x.sort()
Line 76:
===Plot timings===
{{library|matplotlib}}
{{library|numpy}}▼
<code>
import operator
Line 104 ⟶ 106:
See [[Plot x, y arrays]] and [[Polynomial Fitting]] subtask for basic usage of ''pylab.plot()'' and ''numpy.polyfit()''.
▲{{library|numpy}}
<code>
import collections
Line 137 ⟶ 138:
plotdd(ds) # see ``plotdd()`` above
</code>
===Figures: log2( time in microseconds ) vs. log2( sequence length )===
sort_functions=[builtinsort, insertion_sort, insertion_sort_lowb, qsort, qsortranlc, qsortranpart, qsortranpartis]
====ones====
[http://bahus.3ka.mipt.ru/gallery/data/public/24.12.07/energy_104231.png ones.png] (143KiB)
====range====
[http://bahus.3ka.mipt.ru/gallery/data/public/24.12.07/energy_105040.png range.png] (145KiB)
| |||