Vidyalelo
Data Structure · Q884

Miscellaneous on Data Structures

Programming · Data Structure · question 884

Q884

What will be the time complexity of update query operation in an array of size n when we use square root optimization?

A.
O(√n)
B.
O(n)
C.
O(1)
Answer
D.
O(n2)

Answer: Option C

Solution

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