FTA: By inlining C++ is able to run just the raw algorithm. On the opposite the C code has a number of indirections That is a reflection of using qsort ra

FTA: By inlining C++ is able to run just the raw algorithm. On the opposite the C code has a number of indirections That is a reflection of using qsort rather than rolling your own sort. You could write your own macro that replicates what std::sort does and see better performance in C. That same abstraction can be built in C. If you want to argue that the C++ standard library has more utilities to simplify these optimizations, certainly I will agree. I think, however, that the statement that "sorting in C++ is 3 times faster than C" is an unsubstantiated leap.