0 votes 0 votes a) θ(logn) b) θ(nlogn) c) θ(n) answer given is : b Algorithms made-easy-test-series algorithms time-complexity + – charul asked Dec 6, 2017 • edited Mar 7, 2019 by Aditi Singh charul 312 views answer comment Share Follow See 1 comment See all 1 1 comment reply Anu007 commented Dec 6, 2017 i edited by akash.dinkar12 Mar 8, 2019 reply Follow Share n+n/2+n/3+..........+n/n =O(nlogn) 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes O(nlogn) is right abhishekmehta4u answered Mar 8, 2019 • selected Mar 8, 2019 by akash.dinkar12 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
