[geeks] New Tech Schools: Digital Harbor in Baltimore

[der Mouse]

> Has anyone ever come up with a faster algorithm than quicksort?

In the usual complexity-theory sense, quicksort isn't all that good,
because its worst case is quadratic.  There are sort algorithms (such
as heapsort) with N log N worst-case behaviour.

/~\ The ASCII				der Mouse
\ / Ribbon Campaign
 X  Against HTML	       mouse at rodents.montreal.qc.ca
/ \ Email!	     7D C8 61 52 5D E7 2D 39  4E F1 31 3E E8 B3 27 4B