2 votes 2 votes N log (N2) N1.5 which will grow faster Algorithms algorithms logarithmic-function + – A_i_$_h asked Nov 14, 2017 • retagged Jul 7, 2022 by Lakshman Bhaiya A_i_$_h 201 views answer comment Share Follow See 1 comment See all 1 1 comment reply Anu007 commented Nov 14, 2017 reply Follow Share n lon(n2) <n1.5 n log(n2) < n1 n0.5 log(n2) < n0.5 take log both side log (2log(n) ) < 0.5 log(n) 2 votes 2 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes N^1.5 is growing faster than first one SHUBHAM SHASTRI answered Nov 14, 2017 • selected Nov 14, 2017 by A_i_$_h SHUBHAM SHASTRI comment Share Follow See all 0 reply Please log in or register to add a comment.