Q755
What will be the worst case time complexity of finding the sum of elements in a given range of (l,r) in an array of size n when we use square root optimization?
A.
O(n)
B.
O(l+r)
C.
O(√n)
AnswerD.
O(r-l)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board