1. Consider the following iterative function: int square (int n) { int result = 0; for...

Transcribed Image Text:

1. Consider the following iterative function: int square (int n) { int result = 0; for (int i = 1; i <= n; i++) result += 2 * 1 - 1; return result; } Rewrite the function square using recursion and add preconditions and postconditions as comments. Then prove by induction that the recursive function you wrote is correct. 1. Consider the following iterative function: int square (int n) { int result = 0; for (int i = 1; i <= n; i++) result += 2 * 1 - 1; return result; } Rewrite the function square using recursion and add preconditions and postconditions as comments. Then prove by induction that the recursive function you wrote is correct.

Answer rating: 100% (QA)

Heres how to solve the problem 1 Rewrite the iterative function using recursion C int squareint n Base case if n 0 return 0 Recursive case else return squaren 1 2 n 1 2 Add preconditions and postcondi... View the full answer