Certainly I can! Oh no! My secret Cray in the basement secret is out!! <grin>
Of course, this is a constraint to the algorithm. Fortunately, many times the random numbers are within a certain range which CAN be covered by an array's subscripts. And if it can be used, it's run time is faster than any other solution. I don't know the name for this algo, but it's quite a bit faster than quicksort (or any other sorting algorithm), if it can be used. Simply because it doesn't have to sort anything, just increment a value. Dave
