1 1 vote Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$ Algorithms testbook-test-series + – amit166 552 views answer comment Share Follow Print See 1 comment 1 1 comment reply Godlike commented Jan 5, 2023 reply Follow flag https://kconrad.math.uconn.edu/blurbs/analysis/stirling.pdf the formula can be simplified to $\lg n^{n}/n!$ now we can write it as $n\lg n - \lg n!$ $\lg n!$ can be approximate to a certain value called stirlings formula. in the link link you will find the formula, use it to put values and simplif to get answer 0 0 replyShare Please log in or register to add a comment.
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 deepak_7891 answered Jan 5, 2023 deepak_7891 comment Share Follow 0 reply Please log in or register to add a comment.