Anonymous user
Compare sorting algorithms' performance: Difference between revisions
Compare sorting algorithms' performance (view source)
Revision as of 19:00, 24 December 2007
, 16 years ago→Examples of sorting routines: import random
(→Figures: log2( time in microseconds ) vs. log2( sequence length ): + added description of sorting functions) |
m (→Examples of sorting routines: import random) |
||
Line 28:
'''Interpreter:''' [[Python]] 2.5
[[Category:Python]]
===Examples of sorting routines===
def builtinsort(x):
x.sort()
Line 42:
up.append(x)
return low, middle, up
import random
def qsortranpart(seq):
size = len(seq)
Line 48:
low, middle, up = partition(seq, seq[random.randrange(size)])
return qsortranpart(low) + middle + qsortranpart(up)
===Sequence generators===
| |||