random shuffles

Paul Rubin http
Fri Jul 21 14:19:48 EDT 2006


Boris Borcic <bborcic at gmail.com> writes:
> To be more convincing... assume the algorithm is optimal and calls

That assumption is not even slightly realistic.  Real-world sorting
algorithms almost never do a precisely minimal amount of comparison.



More information about the Python-list mailing list