@[email protected] to Programmer [email protected]English • 14 days agoNot my problem sortinfosec.pubimagemessage-square71fedilinkarrow-up1763arrow-down114
arrow-up1749arrow-down1imageNot my problem sortinfosec.pub@[email protected] to Programmer [email protected]English • 14 days agomessage-square71fedilink
minus-square@[email protected]linkfedilink48•14 days 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]linkfedilink43•14 days agoIn the universe where the list is sorted, it doesn’t actually matter how long the destruction takes!
minus-square@[email protected]linkfedilinkEnglish13•14 days 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-square@[email protected]linkfedilink9•14 days 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()