OpenEuphoria

Re: Problem !!!

• Posted by Jacques Deschenes <desja at QUEBECTEL.COM> Feb 21, 1997
• 1202 views

At 14:10 21-02-97 -0500, you wrote:

>"bucket sort" requires *zero* comparisons, but you need
>a reasonable bound on the size of the values you are sorting.
>i.e. allocate a big sequence with 256 (as below) elements,
>and then just count the frequencies of values 1..256 as they occur.
>When you are done, you can step through the sequence and make a
>nicer list of all the values that occurred. If you're interested
>I can write some code for this and post it - it's fairly simple.
>It's an order(N) sort - the fastest possible.

Hi Robert,

  What a suprise to read that.  A sort with *zero* comparisons!
By nature sorting means comparing.  I would certainly be happy to see
that miraculous sort.

Jacques Deschenes
Baie-Comeau, Quebec
Canada
desja at quebectel.com