Q1096
Total how many iterations are required to find the sum of elements in a given range of (l,r) in an array of size n when we use square root optimization?
A.
√n
B.
2*√n
C.
3*√n
AnswerD.
n*√n
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board