Question

4. What is the worst case time complexity for the below loop?
Int foo (int n) {
If (n<=0) return -1;
Else {
Print n
N-n/2;
Return foo (n);
}
}
Pick one of the choices
A. 0(1)
B, O(log n)
C,O(n)
D.O(n^2)

Answer 1

Answer:

b answer of one choise bo (log n)

Answer 2

Answer:

B

Explanation:

Hope it helps

mark as brainliest