• @[email protected]
    link
    fedilink
    9910 hours ago

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

    • NaN
      link
      136 hours 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.

      • @[email protected]
        link
        fedilink
        44 hours ago

        Delete prior iterations of the loop in the same timeline? I’m not sure there’s anything in quantum mechanics to permit that…

    • @[email protected]
      link
      fedilink
      689 hours ago

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

      • @[email protected]
        link
        fedilink
        359 hours 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.

        • @Benjaben
          link
          54 hours ago

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

          Well yeah just delete the pointer to it!

        • @[email protected]
          link
          fedilink
          238 hours ago

          In the universe where the list is sorted, it doesn’t actually matter how long the destruction takes!

      • @[email protected]
        link
        fedilink
        139 hours ago

        Except you missed a bug in the “check if it’s sorted” code and it ends up destroying every universe.

        • @db2
          link
          48 hours ago

          There’s a bug in it now, that’s why we’re still here.

    • @[email protected]
      link
      fedilink
      29 hours ago

      Since randomizing the list increases entropy, it could theoretically make your cpu cooler just before it destroys the universe.