I have a list of lists and I am sorting them using the following
Was wondering what is the runtime complexity of this python method?
O(1) when used with
data, the sort is
O(n log n) both on average and in the worst case.
For more information on the sorting method used in Python, see Wikipedia.
sorted is like sort except that the first builds a new sorted list from an iterable while sort do sort in place. The main difference will be space complexity.