Miscellaneous on Data Structure and Algorithms related Questions and Answers


Question :   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?
1. vn
2. 2*vn
3. 3*vn
4. n*vn
Answer :   3 - 3*vn  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter