Here's a simple and (I hope) self-explanatory illustration of QuickSort.
http://www3.telus.net/ldh/asm/q.asm
It contains an illustrative calling program, in the form of a Windows console app (not a gui app).
To enable the sorting of various kinds of data (strings, numbers, ...) the input to QuickSort is a table of dwords (id's) and the caller supplies the address of a callback routine which does the comparison for any two id's.
Hi Larry, welcome on board, where have ya been for so long ? :bg
Hi Hutch,
I've been away from programming altogether for some time, but I got back to ASM because of a new job. Doing a program about automated translation. Massive string tables, linked in rather complex ways; two fonts in use at the same time; execution speed important.
Larry,
Let us know how you go with it, it sounds like classic assembler target material and if you get it right, it should be very fast as well.