this post was submitted on 10 Jul 2024
9 points (76.5% liked)

VS Code

788 readers
2 users here now

founded 1 year ago
MODERATORS
 

Time complexity isn't even associated to the size of the list. Amazing!

you are viewing a single comment's thread
view the rest of the comments
[–] sxan@midwest.social 3 points 4 months ago (1 children)

This should be taught in computer classes, as an illustration that O(1) does not necessarily mean "fastest".

[–] dev_null@lemmy.ml 1 points 4 months ago (1 children)

It's not O(1) though. There is still a normal sorting algorithm sorting this list, it's just inside the OS scheduler.

[–] sxan@midwest.social 2 points 4 months ago

I didn't mean to imply that it was; I was referring to countless developers I've worked with over the years who thought hash maps were the fastest memory storage structure because they are generally O(1); they've mostly been ignorant of the fact that it's only true for sufficiently small values of "1".