in Algorithms edited by
302 views
0 votes
0 votes

a) θ(logn)

b) θ(nlogn)

c) θ(n)

answer given is : b

in Algorithms edited by
by
302 views

1 comment

edited by
n+n/2+n/3+..........+n/n =O(nlogn)
0
0

1 Answer

2 votes
2 votes
Best answer

O(nlogn) is right

selected by