Question: 11. What is the Big-O running time for this code? Explain your answer. int i = numItems; while (i > 0) i = i /
11. What is the Big-O running time for this code? Explain your answer. int i = numItems; while (i > 0) i = i / 2; // integer division will eventually reach zero 12. What is the Big-O running time for this code? Explain your answer. public static int div(int numItems) { if (numItems == 0) return 0; else return numItems%2 + div(numItems/2); } Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
