• lad
      link
      fedilink
      English
      109 months ago

      Hanoi […] practice problems.

      Like you come to the exam and there’s a 64 piece Tower of Hanoi you need to solve manually to pass the exam

      • JohnEdwa
        link
        fedilink
        39 months ago

        Assuming 1 second per swap, a 64 disk tower of hanoi would take 585 billion years to solve - it has 2^64 -1 swaps.

        • lad
          link
          fedilink
          English
          29 months ago

          And that makes It good enough for an exam

    • @Alexstarfire
      link
      69 months ago

      Yea, get back to me when you get to parallel programming.

      • @FierySpectre
        link
        39 months ago

        Writing kernels for parallel execution with OPENCL gives me flashbacks every time I remember them

      • lad
        link
        fedilink
        English
        19 months ago

        Tis’ not hard, just add some sleeps to make sure other thread reads data before it is destroyed 🌚