Python Big O: the time complexities of different data structures in Python (www.pythonmorsels.com)

submitted 2 weeks ago by norambna@programming.dev to c/python@programming.dev

8 comments fedilink hide all child comments

via https://mastodon.social/@treyhunner/113367936771761302

you are viewing a single comment's thread
view the rest of the comments

[-] eager_eagle@lemmy.world 1 points 1 week ago

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?

[-] FizzyOrange@programming.dev 2 points 1 week ago

Standard ring buffers or circular buffers are implemented as continuous vectors, with a read and write pointer.

Rust's VecDeque is a ring buffer: https://doc.rust-lang.org/std/collections/struct.VecDeque.html

[-] eager_eagle@lemmy.world 0 points 1 week ago

Since VecDeque is a ring buffer, its elements are not necessarily contiguous in memory.

[-] FizzyOrange@programming.dev 2 points 1 week ago

No that's a subtly different thing. The storage is a contiguous vector, but because it is a ring buffer there must be one pair of adjacent elements that are not contiguous in memory. That's what that comment is saying.

But because it is only one discontinuity it doesn't affect algorithmic complexity, so it is still O(1) to access elements, unlike a linked list which is O(N).

If you google "circular buffer" there will be loads of diagrams that make it really obvious how it works.

[-] CodeMonkey@programming.dev 1 points 1 week ago

I am used to seeing ring buffers implemented using an array. They are FIFO if you write to the maximum offset and read from the minimum offset but they are double ended if you have a method to read from the maximum offset and write to the minimum offset.