title: Constants in sorting algorithm runtime
body: <p>When searching for runtime comparison of sorting algorithms, I only find the asymptotic runtime in O(.) notation. I am curious, whether there exists any comparison which actually provides the constants, which are omitted in the Big O notation.</p>