0x4E4F@infosec.pub to Programmer Humor@programming.devEnglish · 2 months agoNot my problem sortinfosec.pubimagemessage-square8fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1imageNot my problem sortinfosec.pub0x4E4F@infosec.pub to Programmer Humor@programming.devEnglish · 2 months agomessage-square8fedilink
minus-squareBatmanAoD@programming.devlinkfedilinkarrow-up1·2 months agoReminds me of quantum-bogosort: randomize the list; check if it is sorted. If it is, you’re done; otherwise, destroy this universe.
minus-squarexmunk@sh.itjust.workslinkfedilinkarrow-up1·2 months agoGuaranteed to sort the list in nearly instantaneous time and with absolutely no downsides that are capable of objecting.
minus-squarefrezik@midwest.sociallinkfedilinkarrow-up0·2 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-squareBatmanAoD@programming.devlinkfedilinkarrow-up1·2 months agoIn the universe where the list is sorted, it doesn’t actually matter how long the destruction takes!
minus-squaregroet@feddit.orglinkfedilinkEnglisharrow-up0·2 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.
Reminds me of quantum-bogosort: randomize the list; check if it is sorted. If it is, you’re done; otherwise, destroy this universe.
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!
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