RmDebArc_52d ago
Don't you understand?
Show threadtrougnouf1d ago
Wouldn’t a pile of clothes have O(n) complexity? They’d still have to go through them one at a time unless the clothes have a really distinct color/shape and are in a somewhat tidy pile s.t. they can be pulled from anywhere.
Show threada_non_monotonic_function
Not if the pile has a maximum capacity. At that point it’s bounded as a fixed constant.
Mar 21 at 3:54pmWeb
Show threadTheseusNow1d ago
Exactly. Since n is represented by the collection of clothes, it is O(1) if you are only going through a finite subset of the clothes. If everything is in the closet, and in no particular order, you would then do O(n) because you potentially have to go through the entire collection to find one article of clothing.