Question: What does it mean when y = 0 for a graph of an algorithm? Like if an algorithm runs in nlog_2(n) steps, what does it

What does it mean when y = 0 for a graph of an algorithm? Like if an algorithm runs in nlog_2(n) steps, what does it mean when n is 1 since 1log_2(1) = 0? Does that mean it runs in 0 steps when n = 1 and is infinitely efficient? Or does that just mean constant time? I'm very confused.

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 Databases Questions!