Question: Give the big O notation (as a function of n) of the running times of the following code fragment: int sum = 0; for
Give the big O notation (as a function of n) of the running times of the following code fragment: int sum = 0; for (int j = n;j> 0; j = j / 3) sum++;
Step by Step Solution
3.47 Rating (163 Votes )
There are 3 Steps involved in it
Lets analyze the running time of the given code fragment In each iteration of ... View full answer
Get step-by-step solutions from verified subject matter experts
