递归---汉诺塔和斐波那契数列

//
//  hanno_fib.cpp
//
//  Created by scandy_yuan on 12-12-27.
//  Copyright (c) 2012年 Sam. All rights reserved.
//

#include <iostream>
using namespace std;

//汉诺塔
void hanno(int n,char a,char b,char c)
{
    //假设只有1个盘子，即为递归退出条件
    if(n==1){
        cout << "the disk from" << " " << a << " " << "to" << " " << c << endl;
        return ;
    }
    //n-1个盘子从a柱借助c柱移到b柱
    hanno(n-1, a, c, b);
    //讲第n个盘子从a柱移到c柱
    cout << "the disk from" << " "  << a  << " " << "to" << " " << c << endl;
    //将n-1个盘子从b柱借助a柱移到c柱
    hanno(n-1, b, a, c);
}

//斐波那契数列
int fib(int n)
{
    return (n==0)?0:(n==1||n==2)?1:fib(n-1)+fib(n-2);
}

int main(int argc, const char * argv[])
{
    //insert code here...
    //测试
    hanno(3, 'A', 'B', 'C');
    
    for(int i=0;i<10;i++)
        cout << fib(i) << " ";
    cout << endl;
    
    return 0;
}