Anonymous user
Compare sorting algorithms' performance: Difference between revisions
Compare sorting algorithms' performance (view source)
Revision as of 07:54, 24 December 2007
, 16 years agono edit summary
(couple examples of sorting routine) |
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.
Consider three type of input sequences:
Line 77:
{{library|matplotlib}}
<code>
import operator
import pylab
def plotdd(dictplotdict):
Line 105 ⟶ 106:
{{library|numpy}}
<code>
import collections
import numpy
def plot_timings():
| |||