An O(1) Sort ~~~

Posted by FlySwat on Stack Overflow See other posts from Stack Overflow or by FlySwat
Published on 2008-08-24T22:59:57Z Indexed on 2010/05/01 22:37 UTC
Read the original article Hit count: 226

Filed under:
|
|

Before you stone me for being a heretic, There is a sort that proclaims to be O(1), called "Bead Sort" (http://en.wikipedia.org/wiki/Bead_sort) , however that is pure theory, when actually applied I found that it was actually O(N * M), which is pretty pathetic.

That said, Lets list out some of the fastest sorts, and their best case and worst case speed in Big O notation.

~~ FlySwat ~~

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about sorting