Surprising (for me) benchmark results...

[John J. Lee]

On Wed, 2 May 2001, Brian Quinlan wrote:

> > There are O(N) sorting algorithms??  I thought that was restricted to
> > quantum computation.
>
> Actually, there are O(N) sorting algorithms. Counting sort is O(N). The
> algorithm is simple but only works in (small) descrete element spaces. The
> following example works with integers:

Well, you learn something new every day here.

:)


John