Strong Induction - Testing an Algorithm's correctness.

Testing Algorithm Correctness Using Strong Induction Given the following algorithm: GG(a,b) if b = 0 return 1 if b is even return GG(a*a, b/2) else return a*GG(a*a, (b-1)/2) Use strong induction to prove: VbEN, Va e R-{0} GG(a,b)=ab Step 1: Proof of base cases Step 2: Inductive step Testing Algorithm Correctness Using Strong Induction Given the following algorithm: GG(a,b) if b = 0 return 1 if b is even return GG(a*a, b/2) else return a*GG(a*a, (b-1)/2) Use strong induction to prove: VbEN, Va e R-{0} GG(a,b)=ab Step 1: Proof of base cases Step 2: Inductive step