0x4E4F@infosec.pub to Programmer Humor@programming.devEnglish · 14 days agoNot my problem sortinfosec.pubexternal-linkmessage-square61fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1external-linkNot my problem sortinfosec.pub0x4E4F@infosec.pub to Programmer Humor@programming.devEnglish · 14 days agomessage-square61fedilink
minus-squarefrezik@midwest.sociallinkfedilinkarrow-up0·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-squareBenjaben@lemmy.worldlinkfedilinkarrow-up0·13 days ago We’ll also assume that destroying the universe takes constant time. Well yeah just delete the pointer to it!
minus-squareBatmanAoD@programming.devlinkfedilinkarrow-up0·14 days agoIn the universe where the list is sorted, it doesn’t actually matter how long the destruction takes!
minus-squaregroet@feddit.orglinkfedilinkEnglisharrow-up0·13 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.
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)