累加和汉诺塔

累加
老师代码：

#include <stdio.h>
 
/**
 * Recursive addition.
 */
int addTo(int paraN) {
	int tempSum;
	printf("entering addTo(%d)\r\n", paraN);
	if (paraN <= 0) {
		printf(" return 0\r\n");
		return 0;
	} else {
		tempSum = addTo(paraN - 1) + paraN;
		printf(" return %d\r\n", tempSum);
		return tempSum;
	}// Of if
}// Of addTo
 
/**
 * A clear version.
 */
int clearAddTo(int paraN) {
	if (paraN <= 0) {
		return 0;
	} else {
		return clearAddTo(paraN - 1) + paraN;
	}// Of if
}// Of clearAddTo
 
/**
 * Test the addTo function.
 */
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");
}// Of addToTest
 
/**
 The entrance.
 */
void main() {
	addToTest();
}

作业`

int add(int n) {
	int sum;
	if (n <=0) {
	    return 0;
	}
	else {
		sum = n + add(n - 1) ;
		return sum;
	}
}

汉诺塔

#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("---- 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");
}// Of addToTest
 
/**
 The entrance.
 */
void main() {
	hanoiTest();
}

作业

void hanoi(int n , char A , char B , char C)
{
  if(n == 1)
    printf("%c---->%c\n",A,C);
  else
  {
    hanoi(n-1,A,C,B);
    printf("%c---->%c\n",A,C);
    hanoi(n-1,B,A,C);
  }
}

PS：在汉诺塔问题上，仅需将N个物体视作第N个与N-1个物体的移动，利用递归思想即可。