it should be true..

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**

0

what happens if we take A = O(n) and B = O(n log n), then also given statement is true?

Otherwise i can't take like that?

2

for(i=0;i<n;i++)

{

count++;

}

time complexity is O(n) =O(n^{2}) =O(n^{3})

But we generally denote with O(n) but it doesn't mean T(n) = O(n^{2}) is wrong., it is also correct.

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.`