552 views
1 1 vote

Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$

1 Answer

0 0 votes

You need To know Some basic Property of log

1st Property is   log(a/b)= Log(a)-log(b)

2nd Pro property is  log(a)+log(b)+log© =log(a*b*c)

3rd Property is   In summation(1 to i) of any Constant we can take Constant out side From Summation(1 to i)

Now you can solve easily

Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
519
519 views
anjali007 asked Dec 17, 2018
519 views
The characters of the string K R P C S N Y T J M are inserted into a hash table of size of size 10 using hash functionh(x) = (ord(x) - ord(A) +1)If linear probing is used...
2 2 votes
1 answers 1 answer
1.0k
1.0k views
Raj_Choudhary asked Nov 22, 2017
1,046 views
Suppose in an array A[] , we exchange elements A[i] and A[i+k] , which were originally out of orderA) at least 1 and at most 2k-1 inversions are removedB) at least 2 and ...
1 1 vote
1 answers 1 answer
746
746 views
Hradesh patel asked Jan 27, 2017
746 views
plz explain ?? i got O(nlogn)
0 0 votes
1 1 answer
450
450 views
Rajib Datta Roy asked Nov 2, 2023
450 views
((f,g)|f(0)=g(0) or f(1)=g(1)) is the relation equivalent on set of function for all Z to Z . I find this to be equivalence relation ,but the solution says its not .ca...