on 08/10/2000 07:03, Jay Reeve at jktr@... wrote:

>> Question: 
>> why we can use such hash algorithms for sorting of strings
>> but can not use them for sorting of numbers ?    :-)

> You can--provided you know the range and something about the expected
> frequency! After all, the ascii codes I was mapping are all numbers. The
> problem with numbers is that their range can be infinite, and most or all of
> the instances being sorted may fall into a very small segment of the range.
> Add a preliminary pass to define the range, and you can hash just fine.


We use computer types which have exact limited range -- long, short, byte,
so we can again split this range into Nth group and use this.


-- 
Best regards,
Ruslan Zasukhin

-------------------------
Paradigma.

e-mail: ruslan@...
web   : http://www.paradigmasoft.com

To subscribe to the Valentina mail list
send a letter to valentina-on@...