数据结构6，汉诺塔问题

#include<stdio.h>

/**
 *Hanoi.
 */
void hanoi(int paraN, char paraSource, char paraDestination, char paraTransit)
{
	if(paraN <= 0)
	{
		return;
	}
	else
	{
		hanoi(paraN - 1, paraSource, paraTransit, paraDestination);
		printf("%c->%c\n", paraSource, paraDestination);
		hanoi(paraN - 1, paraTransit, paraDestination, paraSource);
	}//of if
}//of hanaoi

/**
 *Test the hanoi function.
 */
void hanoiTest()
{
	printf("---- addToTest begins.----\n");
	
	printf("2 plates\n");
	hanoi(2, 'A', 'B', 'C');
	
	printf("3 plates\n");
	hanoi(3, 'A', 'B', 'C');
	
	printf("---- addToTest ends.----\n");
}//of addTOTest.

/**
 The entrance.
 */
int main()
{
	hanoiTest();
	return 0;
}// Of main

运行结果