汉若塔问题（递归）

#include <iostream>
#include <stdio.h>
using namespace std;

static int step = 0;
void move ( char sour, char dest )
{
    printf ( "move from %c to %c \n", sour, dest );
}

void hanoi ( int n, char sour, char temp, char dest )  
{
    if ( n == 1 )
    {
        move ( sour, dest );
        ++step;
    }
    else
    {
        hanoi ( n-1, sour, dest, temp );
        move ( sour,dest );
        ++step;
        hanoi ( n-1, temp, sour, dest );
    }
}
int main ( int argc, char **argv )
{
    int n = 4;
    hanoi ( n, 'A', 'B', 'C' );
    printf ( "Total steps is %d\n", step );
    return 0;
}

 

 

转载于：http://www.cnblogs.com/DanielZheng/archive/2011/08/20/2146453.html