A re-implementation of the LLVM std::sort: uses median-of-three pivot selection, falls back to Heapsort after too many recursion levels, and switches to Insertion sort for sub-arrays below a fixed threshold.
Not a custom variant, this is the exact algorithm that has sorted data in C++ programs for decades, making it a direct historical baseline for comparing all other algorithms in this laboratory.