数据算法与结构 chap03.ppt

BUPT SCST BUPT void fact(int n, int & f) { init_stack(s; 0: if (n==0) f=1; { 1: top=top+1; s[top].rd=2; s[top].n=n; s[top].f=f; n=n-1; goto 0; 2: f=n*f } if (top!=0) { s[top].f=f; top=top-1; n=s[top+1