"RB Smissaert" wrote in message
...
OK, are you saying that to sort a 1-D array of long values a counting sort
is
2 to 3 times faster?
Interesting and I will check that out.

For integer values, Counting Sot is by far the fastest,

What I didn't see in your webpage is how the VB6 code was compiled.
Is this with all the fast options such as not checking the array bounds
etc?

I just use the default values for compiles.

My initial concern was to demonstrate how easy it is to outdo the algorithms
used for sorts within Office.