GNU social JP
  • FAQ
  • Login
GNU social JPは日本のGNU socialサーバーです。
Usage/ToS/admin/test/Pleroma FE
  • Public

    • Public
    • Network
    • Groups
    • Featured
    • Popular
    • People

Conversation

Notices

  1. Embed this notice
    USLUCK (usluck@channels.im)'s status on Saturday, 24-May-2025 16:25:51 JST USLUCK USLUCK

    https://www.usluck.com/539535/recursion/ Recursion #Anime #AnimeMemes #Animemes #Memes

    In conversation about a day ago from channels.im permalink

    Attachments


    1. https://media.channels.im/media_attachments/files/114/561/610/156/893/010/original/5deec55da8f17027.jpeg
    2. Domain not in remote thumbnail source whitelist: www.usluck.com
      Recursion - USLUCK
      from LUCK
      Recursion by 94rud4
    • Embed this notice
      nyanide :nyancat_rainbow::nyancat_body::nyancat_face: (nyanide@lab.nyanide.com)'s status on Saturday, 24-May-2025 16:25:50 JST nyanide :nyancat_rainbow::nyancat_body::nyancat_face: nyanide :nyancat_rainbow::nyancat_body::nyancat_face:
      in reply to
      @usluck is this referring to how function calls are stored on the stack or smth i don't get it
      In conversation about a day ago permalink
    • Embed this notice
      Kirino Kousaka (kirino@shitpost.cloud)'s status on Saturday, 24-May-2025 17:13:07 JST Kirino Kousaka Kirino Kousaka
      in reply to
      • nyanide :nyancat_rainbow::nyancat_body::nyancat_face:
      Sort of, also with sorting algorithms and sich.

      It's called Tower of Hanoi.
      Imagine you have 3 poles (A, B, C) and N disks. The discs can only be in ascending order of size so a larger disk can never go on top of a smaller disk.

      The goal is to move the stack from the left-most column to the right-most column. You can only move one disk at a time and only in a LIFO fashion. Now the trick is writing a program which can solve for it, to be honest I get the joke but... it doesn't seem that hard.

      I'm supposing it might be a leetcode question or a common problem given in CS classes hence the PTSD. It's actually the perfect kind of problem to be broken down into sub-problems -- aka ideal for recursive functions.
      In conversation about a day ago permalink
      nyanide :nyancat_rainbow::nyancat_body::nyancat_face: likes this.
    • Embed this notice
      Protoss (cyrillic@lab.nyanide.com)'s status on Saturday, 24-May-2025 17:46:14 JST Protoss Protoss
      in reply to
      • nyanide :nyancat_rainbow::nyancat_body::nyancat_face:
      • Kirino Kousaka
      @Kirino @usluck @nyanide it was one of the first things featured in the Concrete Mathematics textbook where it was used to teach about recurrence relations. although if this was the source then it would have been the much harder Josephus problem
      In conversation about a day ago permalink

      Attachments


      1. https://meds.lab.nyanide.com/media/52/01/f4/5201f4fb8802ad29864e30699f766951ec10ee70d9fe9ce7ce8c4abf89360a40.jpg

      2. https://meds.lab.nyanide.com/media/bb/da/d9/bbdad9cc3fdc0805467336cb05c412aeeb6912368c0dd6f9c4f7ea4fd51d55a2.png
      nyanide :nyancat_rainbow::nyancat_body::nyancat_face: likes this.

Feeds

  • Activity Streams
  • RSS 2.0
  • Atom
  • Help
  • About
  • FAQ
  • TOS
  • Privacy
  • Source
  • Version
  • Contact

GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.