数据结构 3.5 汉诺塔问题

简单实现了汉诺塔的递归实现，该代码是将b柱子作为过渡，将n个盘子从a移动到c：

1.代码

#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 \r\n", paraSource, paraDestination);
		hanoi(paraN - 1, paraTransit, paraDestination, paraSource);
	}// Of if
}// Of hanoi

/**
 * Test the hanoi function.
 */
void hanoiTest() {
    printf("---- hanoiTest begins. ----\r\n");

	printf("2 plates\r\n");
	hanoi(2, 'A', 'B', 'C');

	printf("3 plates\r\n");
	hanoi(3, 'A', 'B', 'C');

    printf("---- hanoiTest ends. ----\r\n");
}// Of addToTest

/**
 The entrance.
 */
void main() {
	hanoiTest();
}// Of main

2.运行结果