Question: What does the notation O ( log n ) commonly describe about an algorithm? The algorithm runs in constant time irrespective of the input size.

What does the notation O(log n) commonly describe about an algorithm?
The algorithm runs in constant time irrespective of the input size.
The runtime increases linearly with the input size.
The runtime increases quadratically with the input size.
The runtime increases as a factor of the logarithm of the input size.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!