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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!