this post was submitted on 04 Nov 2025
478 points (99.2% liked)

Programmer Humor

27330 readers
2629 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

founded 2 years ago
MODERATORS
Feyter@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev
pylapp@programming.dev
478
timeoutSort (lemmy.ml)
submitted 1 week ago by cm0002@lemmy.world to c/programmer_humor@programming.dev
36 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] Jankatarch@lemmy.world 1 points 4 days ago* (last edited 4 days ago)

This algorithm takes K seconds where K is the value of the greatest element.

This means if you just multiply everything by -1 it will take negative time to sort.

Then you can simply unmultiply and read from end to beginning from now on.

This is faster than having it presorted.