1112
you are viewing a single comment's thread
view the rest of the comments
[-] yetAnotherUser@feddit.de 48 points 1 year ago* (last edited 1 year ago)

Why would you use a pile out of all data structures, only adding is in ϴ(1), searching is in ϴ(n).

I suggest throwing the clothes on the floor and remembering the spot they landed on. That's ϴ(1) for adding and for searching, far superior to a stack of clothes on a chair.

Side note: fuck big O notation, use big ϴ notation >:(

[-] yttrium@lemmy.blahaj.zone 10 points 1 year ago* (last edited 1 year ago)
[-] saigot@lemmy.ca 4 points 1 year ago

There's also big omega (lower bound)

[-] optimal@lemmy.blahaj.zone 1 points 1 year ago

what's the difference?

load more comments (10 replies)
this post was submitted on 19 Oct 2023
1112 points (100.0% liked)

196

16414 readers
1653 users here now

Be sure to follow the rule before you head out.

Rule: You must post before you leave.

^other^ ^rules^

founded 1 year ago
MODERATORS