Question: 7. (2 points) The following code performs integer division. Assume that a and b are positve. int div(int a, int b){ } int count

7. (2 points) The following code performs integer division. Assume that a and b are positve. int div(int a, int b){ } int count = 0; int sum = 0; while (suma) { sum +b; } count++; return count; a. What is the basic operation of the algorithm above? b. How many times is the basic operation executed? c. What is it's running time (?)?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
