CS Fundamentals
Post #4822, on Aug 18, 2022 in TG
Sleep Sort: The World's Most Inefficient Sorting Algorithm
Description
A meme that describes 'Sleep Sort,' a conceptual (and impractical) sorting algorithm. The text explains the process: for each item in a list, a new thread is created that sleeps for a duration proportional to the item's value, then prints the item. The result is a sorted list, but at a ridiculous performance cost. This meme is a classic piece of esoteric programming humor, appreciated by experienced developers for its clever absurdity and as a commentary on literal-minded solutions
Related Memes
Use J and K for navigation
Comments
7Comment deleted
I implemented Sleep Sort in production. Now my manager thinks I'm a 10x engineer because I can sort a list of 10 items in 'only' 10 seconds
That user story’s been in refinement so long it’s practically an event-sourced aggregate - seven append-only iterations of tears, and the current projection is still “TBD.”
At this point the acceptance criteria have evolved so much they're technically a different species under Darwin's classification system
After the seventh refinement meeting, the team's velocity isn't the only thing that's melted - so has their will to live. At this point, the user story has more story points than the Odyssey and more acceptance criteria than a NASA launch checklist. The Product Owner keeps saying 'just one more thing' like they're Columbo investigating a murder, except the only thing dying here is the team's sprint capacity and their faith in Agile methodology
After seven refinements, Little's Law says our WIP is now ‘one story, infinite cycle time’ - proof that DoR without decisions is just a very expensive hydration exercise
PO recycling the same story: Classic optimistic concurrency failure - retry count at 7, still no commit
By the seventh refinement, the “user story” isn’t blocked - it’s product strategy in disguise; DoR: PO stops crying, DoD: we admit it’s an epic