数据结构与算法----汉诺塔（老师作业）

汉诺塔问题是一个典型的递归

代码测试

void hanoiTest() 
{
    printf("---- addToTest begins. ----rn");
 
	printf("2 platesrn");
	hanoi(2, 'A', 'B', 'C');
 
	printf("3 platesrn");
	hanoi(3, 'A', 'B', 'C');
 
    printf("---- addToTest ends. ----rn");
}

递归代码

void hanoi(int paraN, char paraSource, char paraDestination, char paraTransit) 
{
	if (paraN <= 0) 
	{
		return;
	} else 
	{
		hanoi(paraN - 1, paraSource, paraTransit, paraDestination);
		printf("%c -> %c rn", paraSource, paraDestination);
		hanoi(paraN - 1, paraTransit, paraDestination, paraSource);
	}
}

 主函数部分

int main() 
{
	hanoiTest();
}

结果

---- addToTest begins. ----
2 plates
A -> C
A -> B
C -> B
3 plates
A -> B
A -> C
B -> C
A -> B
C -> A
C -> B
A -> B
---- addToTest ends. ----