Python Big O: the time complexities of different data structures in Python
Python Big O: the time complexities of different data structures in Python
www.pythonmorsels.com
Python Big O: the time complexities of different data structures in Python
8 comments
8 comments
Zero surprises. It's the same as in any other language.
And thank god for that. Theoretical computer science is still good ;)
I was a bit surprised that
dequeis implemented as a linked list and not, for example, a ring buffer. It would mean that index reads would be constant time (though insert and delete at an index would be linear time), the opposite of using a linked list.But a ring buffer is a FIFO data structure that can be implemented using linked lists. What ring buffer implementation did you have in mind?