汉诺塔【递归】

#include <stdio.h>

void hanoi(int n, char a, char b, char c){
	if(n == 1){
		printf("%c-->%c\n", a, c);
		return;
	}
	
	hanoi(n - 1, a, c, b);
	printf("%c-->%c\n", a, c);
	hanoi(n - 1, b, a, c);
}

int main(){
	const char a = '1', b = '2', c = '3';
	int n;	
	while(scanf("%d", &n) == 1){
		hanoi(n, a, b, c);
	}
	return 0;
}

不明白为什么不会出现栈溢出的情况