Can this QuickSort work?

[bart.smissaert]

Maybe you should add the code posted by Olaf Schmidt in this NG posting
to sort a 1-D string array to your sorting routines, really fast!

http://shorterlink.co.uk/5583

RBS

 

[bart.smissaert]

Yes, had a quick look at the source and saw some functions without code
and at one
stage I thought you were joking about fast and simple code.
Will give it a try.

RBS

 

[Howard Kaikow]

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.

 

[Howard Kaikow]

Had a look at the CountingSort and it is faster if the range of values
in the array is
small, but it gets much slower if this range is large. My range is very
large, could be from
0 to 1000000000000.

you can use the program I posted at
http://www.standards.com/index.html?Sorting to compare timings.

Your best bet may be QuickSort,

 

[Michael C]

Yes, had a quick look at the source and saw some functions without code

That's an interface, it's the fastest way to call a function in a class
without having to know all the details of the class before hand.

Michael