a) O(1) time
b) O(n2 )time
c) O(log n ) time
d) O(n log n ) time
Answer: a
Explanation: Time complexity is given by the big oh notation.
Related Posts
A _________________ index is the one which satisfies all the columns requested in the query without performing further lookup into the clustered index.
In _______________ index instead of storing all the columns for a record together, each column is stored separately with all other rows in an index.
If an index is _________________ the metadata and statistics continue to exists
What are composite indexes?
Does index take space in the disk?:
What is true about indexes?
Which one is true about clustered index?
Join The Discussion