578 views
0 votes
0 votes

If both of the algorithms A and B need O(nlogn) time then they
both are equally efficient and finish in same amount of time.

TRUE OR FALSE

1 Answer

3 votes
3 votes

Measuring  the time complexity and the exact time are two different things, the asymptotic  notations gives us  approximation about the dependency of the number of steps with respect to the input size and the the exact time can be measured using the system clock .

The answer is false.

No related questions found