VS Code

788 readers

2 users here now

founded 1 year ago

MODERATORS

Ategon@programming.dev

Lodra@programming.dev

Sleep Sort (www.aprogrammerlife.com)

submitted 4 months ago by methototi@kbin.earth to c/vscode@programming.dev

4 comments fedilink hide all child comments

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

top 4 comments

sorted by: hot top controversial new old

[–] 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".

[–] sus@programming.dev 1 points 4 months ago

the environment or operating system will ultimately have to use a sorting algorithm with a normal time complexity to determine the order of events (or it can give up and sort them incorrectly once the time resolution is not high enough)