Ha! Fair enough, though I was thinking something different in two ways. Namely, something that worked on the common collections used by people and more readable than this. Still, bad example.
That doesn't make sense. The whole point of quicksort's algorithm is to do things in place, which requires fast indexed access and mutability.