3.4累加求值 3.5汉诺塔问题

利用递归的思想实现

累加求值

#include<stdio.h>
//函数从0加到n
int addTo(int paraN)
{
	if (paraN <= 0)
	{
		return 0;
	}
	else
		return addTo(paraN - 1) + paraN;
}
void addToTest() {
	int n, sum;
	printf("---- addToTest begins. ----\r\n");

	n = 5;
	sum = addTo(n);
	printf("\r\n0 adds to %d gets %d.\r\n", n, sum);

	n = 1;
	sum = addTo(n);
	printf("\r\n0 adds to %d gets %d.\r\n", n, sum);

	n = -1;
	sum = addTo(n);
	printf("\r\n0 adds to %d gets %d.\r\n", n, sum);


	printf("---- addToTest ends. ----\r\n");
}
void main()
{
	addToTest();
}

运行结果

---- addToTest begins. ----

0 adds to 5 gets 15.

0 adds to 1 gets 1.

0 adds to -1 gets 0.
---- addToTest ends. ----

汉诺塔

#include<stdio.h>
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);
	}
}
void hanoiTest() {
	printf("---- addToTest begins. ----\r\n");

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

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

	printf("---- addToTest ends. ----\r\n");
}
void 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. ----