Choose a small range for recursion.

[ikspress]

In libc++, they choose a smaller range for recursion, which reduces the recursion depth. This could be very useful?

[orlp]

This just unnecessarily introduces a branch. Pattern-defeating quicksort is already limited to O(log n) stack depth, which should avoid any stack overflow.