2 votes 2 votes Algorithms algorithms time-complexity made-easy-test-series + – Pratik Gawali asked Jan 15, 2019 • edited Mar 4, 2019 by ajaysoni1924 Pratik Gawali 495 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply kumar.dilip commented Jan 15, 2019 reply Follow Share $1536$ 0 votes 0 votes Pratik Gawali commented Jan 15, 2019 reply Follow Share 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 ? 0 votes 0 votes SuvasishDutta commented Apr 29, 2019 reply Follow Share @Pratik Gawali plz see this picture below: 0 votes 0 votes rish1602 commented Jun 16, 2021 reply Follow Share 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... 0 votes 0 votes Please log in or register to add a comment.
