Quicksort is O(log n) space, not O(1).
You don't have to do this if you're already using a hybrid sort to prevent Quicksort's worst case, like introsort or (shameless self promotion) pdqsort (https://github.com/orlp/pdqsort).
I haven't run the math, but I don't believe introsort fixes this. It's a constant-factor optimization.