0x4E4F@infosec.pub to Programmer Humor@programming.devEnglish · 5 days agoNot my problem sortinfosec.pubimagemessage-square67fedilinkarrow-up1721arrow-down114
arrow-up1707arrow-down1imageNot my problem sortinfosec.pub0x4E4F@infosec.pub to Programmer Humor@programming.devEnglish · 5 days agomessage-square67fedilink
minus-squarexmunk@sh.itjust.workslinkfedilinkarrow-up90·5 days agoGuaranteed to sort the list in nearly instantaneous time and with absolutely no downsides that are capable of objecting.
minus-squarefrezik@midwest.sociallinkfedilinkarrow-up46·5 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-squareBatmanAoD@programming.devlinkfedilinkarrow-up40·5 days agoIn the universe where the list is sorted, it doesn’t actually matter how long the destruction takes!
minus-squareBenjaben@lemmy.worldlinkfedilinkarrow-up8·5 days ago We’ll also assume that destroying the universe takes constant time. Well yeah just delete the pointer to it!
minus-squarevithigar@lemmy.calinkfedilinkarrow-up16·5 days agoExcept you missed a bug in the “check if it’s sorted” code and it ends up destroying every universe.
minus-squaredb2@lemmy.worldlinkfedilinkarrow-up6·5 days agoThere’s a bug in it now, that’s why we’re still here.
Guaranteed to sort the list in nearly instantaneous time and with absolutely no downsides that are capable of objecting.
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!
amortized O(0)
Well yeah just delete the pointer to it!
universe.take()Except you missed a bug in the “check if it’s sorted” code and it ends up destroying every universe.
There’s a bug in it now, that’s why we’re still here.
deleted by creator