What will be the worst case time complexity of finding the sum of elem – McqOptions

MCQOPTIONS

1.	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)
D.	O(r-l)
Answer» D. O(r-l)

Discussion

No Comment Found

Related MCQs

What will be the time complexity of the code to find a minimum element from an array of size n and uses square root decomposition(exclude pre processing time)?
Mo s algorithm can only be used for problems where the query can be calculated from the result of the previous query.
What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries when we apply MO s algorithm?
What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries?
Square root decomposition technique is only applicable when the number of indices in an array is a perfect square.
What will be the time complexity of update query operation in an array of size n when we use square root optimization?
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?
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?
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?
By what factor time complexity is reduced when we apply square root decomposition to a code?