Recursive function to calculate Hanoi tower - C++ Function

C++ examples for Function:Recursive Function

  1. HOME
  2. C++
  3. Function
  4. Recursive Function

Description

Recursive function to calculate Hanoi tower

Demo Code

#include <iostream>
using namespace std;
void move_rings(int n, int src, int dest, int other);
void move_a_ring(int src, int dest);
int main()//from  w w  w.  java2  s  .c  o m
{
   int n = 3;  // Stack is 3 rings high
   move_rings(n, 1, 3, 2); // Move stack 1 to stack 3
   return 0;
}
void move_rings(int n, int src, int dest, int other) {
   if (n == 1) {
      move_a_ring(src, dest);
   } else {
      move_rings(n - 1, src, other, dest);
      move_a_ring(src, dest);
      move_rings(n - 1, other, dest, src);
   }
}
void move_a_ring(int src, int dest) {
   cout << "Move from " << src << " to " << dest << endl;
}

Result


Related Tutorials