35
Python Big O: the time complexities of different data structures in Python (www.pythonmorsels.com)
submitted 4 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
[-] FizzyOrange@programming.dev 2 points 3 weeks 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.

this post was submitted on 25 Oct 2024
35 points (97.3% liked)

Python

6394 readers
12 users here now

Welcome to the Python community on the programming.dev Lemmy instance!

📅 Events

PastNovember 2023

October 2023

July 2023

August 2023

September 2023

🐍 Python project:
💓 Python Community:
✨ Python Ecosystem:
🌌 Fediverse
Communities
Projects
Feeds

founded 1 year ago
MODERATORS
erlingur@programming.dev
jnovinger@programming.dev
norambna@programming.dev