Scribd Logo
Upload

Welcome to Scribd!

  • Tower of Hanoi

    Uploaded by

    Pratik Salunke
    4 views1 page
    This C program implements the Towers of Hanoi problem recursively. It defines a TOH function that moves disks from a source to a destination peg using a helper peg, with the number of moves printed. The main function calls TOH to solve the problem for 3 disks, moving them from peg A to peg B using peg C.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C program implements the Towers of Hanoi problem recursively. It defines a TOH function that moves disks from a source to a destination peg using a helper peg, with the number of moves printed. The main function calls TOH to solve the problem for 3 disks, moving them from peg A to peg B using peg C.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    Tower of Hanoi

    Uploaded by

    Pratik Salunke
    This C program implements the Towers of Hanoi problem recursively. It defines a TOH function that moves disks from a source to a destination peg using a helper peg, with the number of moves printed. The main function calls TOH to solve the problem for 3 disks, moving them from peg A to peg B using peg C.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    #include<stdio.

    h>

    int TOH(int n,char source, char destination, char helper)


    {
    if(n==0)
    {
    return 0;
    }
    TOH(n-1,source,helper,destination);
    printf("\n%d rings moved from %c to %c ",n,source, destination);
    TOH(n-1,helper, destination,source);
    }

    int main()
    {
    TOH(3,'A','B','C');
    return 0;
    }

    You might also like