Well, I didn't say "worst case". If qsort only provided a constant ratio time im...

kcorbitt · on Aug 14, 2017

Actually, big-O complexity by definition is determined based on the worst case. https://stackoverflow.com/questions/3230122/big-oh-vs-big-th...

anarazel · on Aug 14, 2017

Sure, you can point to algorithms that nobody experienced ever uses. But if you e.g. compare qsort usage with heapsort usage, people use qsort because of it's better constant factors, even though the worst case complexity is worse.