Non-recursive Quicksort Algorithm

BlitzMax Forums/BlitzMax Programming/Non-recursive Quicksort Algorithm

The forum is locked. These are the original blitzbasic.com forums, kept so they can still be read. No new topics, replies or edits can be made here. To join in, head over to the Blitz3D+ forums.

kenshin

I recall seeing a BASIC version of Quicksort which was completely non-recursive. Can't find it again though. I've looked over the net for a while, but all I can find are examples that contain some form of recursion. The algorithm I'm talking about used a pair of arrays and a pointer to keep track of the heads/tails.

Any help would be greatly appreciated.