above activation address also amount ar base because below blank call called calls case causes clearer clone clones code consider constant correctness current data definition different equation equations error example executes executing factorial factorial(k+1 fib fibonacci fill first following given guess i.e induction infinite informal int iteration iterative just k+1 k1 k2 k3 leads less let's line linked list little look made main make makes many marker mathematical memory method methods must n+1 n-1 n-2 n=0 need note number original parameter previous print printchar printed printint printint(int prints problem program progress prove public pushed question really reason reasoning record records recurrence recursion recursive required result return returns rule runtime second see show shown simpler size slower solution solving stack statement static step steps str string structure structures sum system.out.println system.out.println(k t(0 t(1 t(n t(n-1 test think time times tmp total use using usually value values version void vowels way work