Have you measured? These functions can still come in handy at times (and inlining increase the binary size), and if your bottleneck is in a sorting routine, you likely have other problems. Quicksort would probably be the wrong choice anyway.
I 100% agree with the idea that the bottleneck might be somewhere else and it probably doesn't matter.
But yes, I have seen numbers comparing qsort and std::sort. There is no competition in this. The latter is pretty much always vastly better in wall clock time due to inlining.
Yes you trade code size for that, but today memory and storage is cheap.
