@[email protected] to Programmer [email protected]English • 6 months agoNot my problem sortinfosec.pubimagemessage-square67fedilinkarrow-up1745
arrow-up1745imageNot my problem sortinfosec.pub@[email protected] to Programmer [email protected]English • 6 months agomessage-square67fedilink
minus-square@[email protected]linkfedilink47•6 months 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-squareYonderEpochslinkfedilink9•6 months ago We’ll also assume that destroying the universe takes constant time. Well yeah just delete the pointer to it!
minus-square@[email protected]linkfedilink43•6 months agoIn the universe where the list is sorted, it doesn’t actually matter how long the destruction takes!
minus-square@[email protected]linkfedilinkEnglish13•6 months 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.
You still have to check that it’s sorted, which is O(n).
We’ll also assume that destroying the universe takes constant time.
Well yeah just delete the pointer to it!
universe.take()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)