MadeEasy Subject Test 2019: Algorithms - Time Complexity

Question

Comments

$1536$

---

It is correct as per the test series but I have a doubt:

To arrive at 1536 as an answer, T(n) = c.nlogn

but T(n) = c1.nlogn + c2.n + c3 is also a valid equation corresponding to θ(nlogn)

So what is the reason for T(n) = c.nlogn ?

---

@Pratik Gawali plz see this picture below:

---

I have a doubt.

I know that 0(n logn) is basically a function with nlogn term i.e. cn *logn

My question is why cannot we write it as nlogn + c  as its time complexity also becomes 0(nlogn)  ?

@SuvasishDutta @ kumar.dilip   

 

please help...thanks in advance...