The complexity of Binary search algorithm is I. O(n) II. O(log n) II. O(n^2) IV. O(n log n) V. None of the above O IV ov O|I >

Extracted text: The complexity of Binary search algorithm is I. O(n) II. O(log n) II. O(n^2) IV. O(n log n) V. None of the above O IV ov O|I >


Extracted text: What is the time complexity of the following algorithm power(n.x).? Assume that each operation takes a unit time. LongPower(int n, int x) { long ans; if(n==0) return 1; elsel ans = Power (n/2, x) * Power (n/2, x); if (n % 2 == 1) ans *= x; return ans; A: Ө (n) B: Ө (ogn) C: e (n logn) D: e (n^2) E: None of the above O A B D O E C.