You want to think your pile is O(1) for retrieval, but it's actually O(n).
Meanwhile, the closet actually is O(1) for retrieval, but you don't want to spend the time for the bulk insert it requires beforehand.
this post was submitted on 24 Nov 2025
539 points (97.7% liked)
Microblog Memes
9712 readers
1596 users here now
A place to share screenshots of Microblog posts, whether from Mastodon, tumblr, ~~Twitter~~ X, KBin, Threads or elsewhere.
Created as an evolution of White People Twitter and other tweet-capture subreddits.
Rules:
- Please put at least one word relevant to the post in the post title.
- Be nice.
- No advertising, brand promotion or guerilla marketing.
- Posters are encouraged to link to the toot or tweet etc in the description of posts.
Related communities:
founded 2 years ago
MODERATORS
- O(n) worst case
- O(log(n)) average case
- O(1) best case
- O(2) median case
That last one: it's a LIFO stack. You might not immediately wear what you threw on last night, but probably would wear the thong under that
Yeah I was going to say - unless your pile is ordered and indexed then it is not a cache and is more like random access.
A pile is a messy stack, with access to push and pop only from the top. It is ordered (from the top down), but not indexed.
My pile of chairs on my clothe has a constant size. O(1) baby!
Now if you store things in vertical stacks only accessible from above... Yeah I keep my clothes on the drying rack so I spend 0 time storing anything lol
I too am on the spectrum. Kind regards
Insert closet joke.
Not using a chair to store semi dirty clothes is absurd. Wearing shorts two days in a row saves a lot of laundry.
I get the concept but this really leads to a dingy /musty smelling enclosure after a while. I’ll take some clean clothes smell even if it’s an extra wash.
Async