@[email protected] to Programmer [email protected]English • 1 year agoNot my problem sortinfosec.pubimagemessage-square70fedilinkarrow-up1769arrow-down114
arrow-up1755arrow-down1imageNot my problem sortinfosec.pub@[email protected] to Programmer [email protected]English • 1 year agomessage-square70fedilink
minus-square@[email protected]linkfedilink48•1 year agoYou still have to check that it’s sorted, which is O(n). We’ll also assume that destroying the universe takes constant time.
minus-square@[email protected]linkfedilink44•1 year agoIn the universe where the list is sorted, it doesn’t actually matter how long the destruction takes!
minus-square@[email protected]linkfedilinkEnglish13•1 year agoIt actually takes a few trillion years but its fine because we just stop considering the “failed” universes because they will be gone soon™ anyway.
minus-squareYonderEpochslinkfedilink9•1 year ago We’ll also assume that destroying the universe takes constant time. Well yeah just delete the pointer to it!
You still have to check that it’s sorted, which is O(n).
We’ll also assume that destroying the universe takes constant time.
In the universe where the list is sorted, it doesn’t actually matter how long the destruction takes!
It actually takes a few trillion years but its fine because we just stop considering the “failed” universes because they will be gone soon™ anyway.
Eh, trillion is a constant
amortized O(0)
Well yeah just delete the pointer to it!
universe.take()