Question: Consider the following algorithm (remember that integer division truncates): int halfIt (int n) { if (n > 0) { return 1 + halfIt (n/2); }
Consider the following algorithm (remember that integer division truncates):
int halfIt (int n) {
if (n > 0) {
return 1 + halfIt (n/2);
} else {
return 0;
}
}
What does halfIt(n) return? Your answer should be a function of n. Prove that the algorithm is correct.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
