>>>If anyone's interested in seeing the implementation of these three sorts (Quick, Bubble, and Selection/Exchange), I'll be happy to post. Just give me some time. It's been quite a while since I wrote a QuickSort.
>>
>>I don't know about the others, but I'd like to see your implementations. But no hurry, whenever you get some free time ... I know a smart guy like you has lots of free time. :-)
>>
>Hi Bill,
>
>Very funny:-) If I'm so smart, how come I have to work for a living?< g > Seriously, the QuickSort isn't "quick" to implement, especially if you've never done it in VFP (which I haven't). One of the reasons for the complexity is that it's a recursive sort. The other two are relatively simple. Even so, the indirect portion makes it a bit more complicated. What I'll do to simulate this in VFP will be to create an array n by 2. The first column will contain the "pointer" to the data in the second. In order to achieve the indirection, the items in column two will be the ones compared but the items in column 1 will be the ones swapped.

You ... Work? Why, I'm shocked, shocked! :-)

I don't do much with recursion, enought to know it can really get you into trouble. :-) But this all sound really interesting and I'll be looking forward to seeing it when you can get around to it.

Thanks George.