Vidyalelo
Data Structure · Q496

Miscellaneous on Data Structures

Programming · Data Structure · question 496

Q496

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?

A.
O(n)
B.
O(q)
C.
O(n*q)
Answer
D.
O(n+q)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board