this post was submitted on 18 May 2024
51 points (96.4% liked)

Python

6381 readers
64 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
51
Python Big O: the time complexities of different data structures in Python (www.pythonmorsels.com)
submitted 6 months ago by ericjmorey@programming.dev to c/python@programming.dev
9 comments fedilink hide all child comments
 

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

you are viewing a single comment's thread
view the rest of the comments
[–] sugar_in_your_tea@sh.itjust.works 3 points 6 months ago* (last edited 6 months ago) (1 children)

Nope, sets are unordered.

[–] Nomecks@lemmy.ca 1 points 6 months ago (1 children)

Ah, sorry. Sets are unique, not ordered. Thanks!

[–] sugar_in_your_tea@sh.itjust.works 1 points 6 months ago

Yeah, I just think it's kind of odd though. If a language only has lists and hash maps, my go-to is to use a hash map for uniqueness, and sort the list for ordered lists.

But in Python, it's backwards where I use the hash map (dict) for ordered data and the set for uniqueness, because hash maps are unordered in most languages I've used.