Computer scienceProgramming languagesPythonAdditional instrumentsAlgorithms and data structures

sort() under the hood

Theory

Time complexity of Timsort

Report a typo

It's always good to know the time complexity of the algorithm you're going to use. What is the big-O for the average, best and worst cases for Timsort?

Choose one option for each row
O(nlog(n))O(n)
average case
the worst case
the best case
___

Create a free account to access the full topic