Miscellaneous on Data Structure and Algorithms related Questions and Answers

Question :   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? 1. O(n) 2. O(l+r) 3. O(vn) 4. O(r-l) Answer :   3 - O(vn)