The Ethan Weiner Duplicate :|
Aga,
Don't sell your implementation short. Granted, yours and Ethan Winer's implementation are fundamentally a Quicksort approach.
However, I compared your code to Winer's, and they are quite different. There's no way you could say that yours was modelled after his. The similarities are only in design; that is, they basically do a form of Quicksort, replace the original Quicksort recursion by handling a proprietary stack, and do not compute a random pivot position, using a simple half-way point instead.
So, I think your sort algorithm deserves a name. Meanwhile, here at QBN, we can refer to it as the AgaSort.
*****
