• BatmanAoD@programming.dev
    link
    fedilink
    arrow-up
    0
    ·
    2 months ago

    Reminds me of quantum-bogosort: randomize the list; check if it is sorted. If it is, you’re done; otherwise, destroy this universe.

    • xmunk@sh.itjust.works
      link
      fedilink
      arrow-up
      0
      ·
      2 months ago

      Guaranteed to sort the list in nearly instantaneous time and with absolutely no downsides that are capable of objecting.

      • frezik@midwest.social
        link
        fedilink
        arrow-up
        0
        ·
        2 months ago

        You still have to check that it’s sorted, which is O(n).

        We’ll also assume that destroying the universe takes constant time.

          • groet@feddit.org
            link
            fedilink
            English
            arrow-up
            0
            ·
            2 months ago

            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.

    • NaN@lemmy.world
      link
      fedilink
      arrow-up
      0
      ·
      2 months ago

      Instead of destroying the universe, can we destroy prior, failed shuffle/check iterations to retain o(1)? Then we wouldn’t have to reload all of creation into RAM.