[prog] quick sort using loops

[ed orphan]

This is  a Linux C question on sorting.
Can anyone tell me where on the Web I can
find an a C example of the quick sort
using loops instead of recursion?
I understand the quick sort's median of 3
for the pivot and the idea of partitioning
the array to be sorted, but I'd like to
get rid of the recusion so I can see the
entire logic of it without having to wade
through the stack. Besides, loops are
faster and isn't that the whole idea of the
quick sort?
   I've already made a few failed searches
on the Web for a looping quick sort. Can
anyone give me any addresses or ideas
where I might find the beast?