1 votes 1 votes Arrange in increasing order of rate of growth: 2n nlogn n(logn) n(3/2) Algorithms time-complexity + – akankshadewangan24 asked Apr 24, 2017 • edited Apr 24, 2017 by Prashant. akankshadewangan24 3.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes plz correct me if i m wrong...... akash.dinkar12 answered Apr 24, 2017 akash.dinkar12 comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments akankshadewangan24 commented Apr 30, 2017 reply Follow Share yes u rght ,but still if u put n=1000 u got different ans how to get out of that kind of confusssions???????????????? 0 votes 0 votes aehkn commented Apr 30, 2017 reply Follow Share in most cases log will help you and for above situation it quite correct and if we consider base 10 of log for above situation it is correct 0 votes 0 votes akankshadewangan24 commented Apr 30, 2017 reply Follow Share so my answer is also correct . 0 votes 0 votes Please log in or register to add a comment.