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
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Introduction to Probability
Authors: Mark Daniel Ward, Ellen Gundlach
1st edition
716771098, 978-1319060893, 1319060897, 978-0716771098
