Write and explain a simple and tight expression for the worst-case big O running time of the following code snippet in terms of the input size, n. for (i=0; i0){ total++; j = j/2; Worst-Case Big O Time

Worst-Case Big O Time

Worst-case scenarios for the execution of this code are O(logn), in which n is the input. The for loop will run logn times because j is divided by 2 each time it runs the for loop. The initial value for j is 1. Each time it is divided with 2, the number iterations required to reach 0 increases by 1. The worst scenario is that the for loop would be executed logn time. (Kevin Wayne (2021)The assignment statement “total++” and the conditional statement “if (j > 0)” will both execute in constant time while they are both included within the for loop. This will result in the entire code snippet’s execution not being affected. The worst case scenario is that the code snippet will take O(logn) time to execute. Cont…