Python Big O: the time complexities of different data structures in Python
Python Big O: the time complexities of different data structures in Python
The time complexity of common operations on Python's many data structures.
Trey Hunner writes:
This article is primarily meant to act as a Python time complexity cheat sheet for those who already understand what time complexity is and how the time complexity of an operation might affect your code. For a more thorough explanation of time complexity see Ned Batchelder's article/talk on this subject.
Read Python Big O: the time complexities of different data structures in Python
Cheers, always good to be aware of these concepts even if Pythons is far from 'blazingly fast'
sorted_sequence.index(item)
Shouldn't this be
O(n log n)? I guess Python doesn't have a list that stays sorted.As a workaround, just use dict keys with no values instead.
Sets stay sorted, no?
Nope, sets are unordered.
Damn, I was hoping someone had python running a Megadeus.
I don't know what that means
