C++ Data Structure

Recursion

Sketch Inductive Proof (by using some values)

The function that computes the sum of all even numbers less than or equal to n:

(1) Sketch an inductive proof that your function in (1) is correct. ((ex) Base case:~~, Inductive case:~~)

-------------------------------------------------------------------------------------

Recursively implement multiplication of two unsigned ints, a and b, using only addition. If you use *, you get no credit. Assume that a >= 0. (Hint: think about multiplication as repeated addition.):

(2) Sketch an inductive proof that your function in (2) is correct.

int sum evens (un signed int n) if (n 0) base case return 0; else if (n s 2 0) return n sum evens (n 2) else return sum evens (n 1)