this post was submitted on 28 Jan 2024

280 points (95.5% liked)

Programmer Humor

19623 readers

411 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

Keep content in english
No advertisements
Posts must be related to programming or programmer topics

founded 1 year ago

MODERATORS

Feyter@programming.dev

anzo@programming.dev

BurningTurtle@programming.dev

pylapp@programming.dev

280

Returns a sorted list in O(1) time (programming.dev)

submitted 9 months ago by JPDev@programming.dev to c/programmer_humor@programming.dev

27 comments fedilink hide all child comments

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

[–] murtaza64@programming.dev 12 points 9 months ago (2 children)

you can make it sort the first k elements and it will still be O(1). Set k high enough and it might even be useful

[–] xmunk@sh.itjust.works 5 points 9 months ago

I set k to 50,000,000,000... that's more items than my shitty computer can fit in memory (including swsp) but I am now happy to celebrate my O(1) algorithm.

[–] kuberoot@discuss.tchncs.de 1 points 9 months ago

By that logic, any sorting implementation is O(1), as the indexing variable/address type has limited size