Your welcome, but if you gave us a little more information, we could probably suggest a better solution.
For example, how many bits are in each of your integers?
How many do you need to sort?
Storing a million integers in a standard perl array and sorting them is an almost everyday procedure. Even on my 233Mhz laptop it takes less than five minutes using perls builtin sort. So, unless you have a very large number, or the integers are very large, the standard sort would probably suffice.
If you have a very large number of small integers, say 100_000_000 x 8-bits or less, or 1_000_000 x say 128 bit, this could still be done with a custom sort routine without too much trouble.
Knowing what your requirements are would allow someone here to suggest a solution.
In reply to Re: Re: Re: sorting a vec
by BrowserUk
in thread sorting a vec
by mcinnes
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |