Login / Signup

Question

An algorithm with a time complexity of O(log
n) means that its execution time:

A Grows linearly with the input size.

B Grows quadratically with the input size.

C Grows logarithmically with the input size, becoming very efficient for large inputs.

D Is constant, regardless of the input size.

E Is dependent on the square of the input size.

Practice Next

More Data Structure Questions

Which of the following is a key characteristic of an effective Management Information System (MIS)?
KMP pattern matching avoids:
Which of the following is a key principle of the SOLID design principles that focuses on ensuring a class has only one reason to change?
Which of the following is NOT a valid feature of IPv6 compared to IPv4?
In C++, which access specifier makes members accessible only from within the class itself and from friend functions/classes?
In a binary tree, what is the maximum number of children a node can have?
Which of the following is NOT a type of graph representation?
Which of the following is the primary goal of a Cross-Site Scripting (XSS) attack?
Which of the following correctly describes the primary difference between Cross-Site Request Forgery (CSRF) and Cross-Site Scripting (XSS)?
Which data structure is used in recursion?

Hey! Ask a query

ask-question