C语言汉诺塔递归算法，图片中框框中加上之后为甚么会出现错误呢

#include

void move(int n,char a,char b,char c)
{
//
if(n==1)
printf("1=%c,2=%c,3=%c\n",a,b,c);
printf("========1#%c->%c\n",a,c); //当n只有1个的时候直接从a移动到c
else
{
move(n-1,a,c,b); //第n-1个要从a通过c移动到b
printf("1=%c,2=%c,3=%c\n",a,b,c);
printf("\t%d#%c->%c\n",n,a,c);
move(n-1,b,a,c); //n-1个移动过来之后b变开始盘，b通过a移动到c，这边很难理解
}
}

main()
{
int n;
printf("请输入要移动的块数：");
scanf("%d",&n);
move(n,'a','b','c');
}

加上if下面就两行了 
需要加大括号的
 if(n==1)
 {
        printf("1=%c,2=%c,3=%c\n",a,b,c);
        printf("========1#%c->%c\n",a,c);    //当n只有1个的时候直接从a移动到c
 }不加 if就只管一行

下面的else就成了孤魂野鬼了

#include

#define maxstack 10  

int c = 1;

struct hanoi { int n; char x, y, z; };

void move(char x, int n, char y) { printf("%d. move disk %d from %c to %cn", c++, n, x, y); }

void hanoi(int n, char x, char y, char z) { if (1 == n) move(x, 1, z); else { hanoi(n - 1, x, z, y); move(x, n, z); hanoi(n - 1, y, x, z); } }

void push(struct hanoi *p, int top, char x, char y, char z,int n) { p[top+1].n = n - 1; p[top+1].x = x; p[top+1].y = y; p[top+1].z = z; }

void unreverse_hanoi(struct hanoi *p) { int top = 0;

while (top >= 0) { while (p[top].n > 1) {    push(p, top, p[top].x, p[top].z, p[top].y, p[top].n);    top++; } if (p[top].n == 1) {    move(p[top].x, 1, p[top].z);    top--; } if (top >= 0) {    move(p[top].x, p[top].n, p[top].z);    top--;    push(p, top, p[top+1].y, p[top+1].x, p[top+1].z, p[top+1].n);    top++; } } }

int main(void) { int i; printf("reverse program:n"); hanoi(3, 'x', 'y', 'z'); printf("unreverse program:n"); struct hanoi p[maxstack]; c = 1; p[0].n = 3; p[0].x = 'x', p[0].y = 'y', p[0].z = 'z'; unreverse_hanoi(p);

return 0; }