I'm not sure I agree with the idea that this somehow characterizes the idea of quicksort better. Technically, you can always convert a recursive algorithm to i

I'm not sure I agree with the idea that this somehow characterizes the idea of quicksort better. Technically, you can always convert a recursive algorithm to iterative and back again (and not just with existence arguments -- it can be generally constructed), so why pick on quicksort specifically? The only thing achieved here is putting the partitioning of the list and sorting in two separable parts. Whether that characterizes quicksort any better is a matter of opinion, I reckon.