... t 14 H th ctruy h iTh d 2: S FibonacciHth ctruyh i:FN= FN -1 + FN-2for N 2F0= F 1 = 1 1, 1, 2, 3, 5, 8 ,13 , 21, …function( integer): integer;beginif N<= 1 then fibonacci:= 1 else ... C(2n -1 ) + 1 =C(2n-2) +1+ 1=C(2n-3)+ 3..=C(20)+ n= C 1 +n= nCN=n =lgNCNlgN 18 Kh quyV n :Gi ithu tkhông quy th ng làm vi c h u hi uvà dki msoát h n1 gi ithu t quy.Làm cáchnàochuy ... n;stackM[top]=m;stackADD[top] =1; n= n -1 ; goto L0;L1:// 2ndrecursive calltop= top +1; stackN[top]= n;stackM[top]=m;stackADD[top]=2;n= n -1 ; m=m -1 ; goto L0;L2: a=stackF[topF], topF = topF 1; b=stackF[topF],topF=topF 1; c=a+...