On Thu, Aug 23, 2001 at 04:32:02PM -0300, Mellotto wrote:
> %map = (
> 1 => 1,
> 2 => 10,
> 3 => 200,
> 4 => 2,
> 5 => 5,
> 6 => 150,
> 7 => 45,
> 9 => 12,
> 8 => 30,
> 10 => 13,
> );
The question you asked has been answered by others. However, there may be
an answer to a question you didn't ask. Why are you using a hash for this?
If all of the keys are numbers in sequence then the better data structure
would be an array. That would solve your sorting problem (an array is
already implicitly sorted by index), and lookups will be faster.
Michael
--
Administrator www.shoebox.net
Programmer, System Administrator www.gallanttech.com
--
--
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
