I think that this is like a nonrandomized quicksort. It might actually work more efficiently since it doesn't need to use randomness. Pretty cool stuff.

Also, I think it would technically be $O(n \log A )$.