2 votes 2 votes Can you please solve this following question further? What will be the time complexity? Algorithms time-complexity algorithms asymptotic-notation cormen recurrence-relation + – Manu Thakur asked Aug 18, 2017 retagged Aug 11, 2022 by Shubham Sharma 2 Manu Thakur 1.4k views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments joshi_nitish commented Aug 18, 2017 reply Follow Share suppose for example, i have given you some series like this, S=3+4+7+9+16+17.........100.(assume there are 75 terms in this series) in worst case if i cant find any pattern, i can atleast say that 3*75 <= S <= 100*75 this is what i used above... 1 votes 1 votes Manu Thakur commented Aug 18, 2017 reply Follow Share ok, do you know what will be the sum of this series 1/log2 + 1/log3 +1/log4 + ...... is there any formula? 0 votes 0 votes joshi_nitish commented Aug 18, 2017 reply Follow Share no, i dont know.. i think it could be derived using taylor or maclauren series principles, but that is not in syllabus. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes First of all second part is a decreasing function so there will be no effect of f (n)= 1/log (n) so you can just neglect it and just find complexity for T (n)=T (n-2) that is O(n). Ankit Srivastava 7 answered Aug 27, 2017 Ankit Srivastava 7 comment Share Follow See all 0 reply Please log in or register to add a comment.