1 votes 1 votes I am unable to Find its time complexity using Iterative method… Will any one help me out with this . Thank you :) Algorithms time-complexity algorithms asymptotic-notation + – Nandkishor3939 asked Jan 18, 2019 Nandkishor3939 675 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply prashant jha 1 commented Jan 18, 2019 reply Follow Share This one is like divide and conquer paradigm , apply Master's theorem 0 votes 0 votes Nandkishor3939 commented Jan 18, 2019 reply Follow Share Can you find its answer without using Masters theorem 0 votes 0 votes prashant jha 1 commented Jan 18, 2019 reply Follow Share I'll try :) 0 votes 0 votes Nandkishor3939 commented Jan 18, 2019 reply Follow Share I got stuck here :p 0 votes 0 votes prashant jha 1 commented Jan 18, 2019 reply Follow Share You forgot to multiply with coefficients , it will be n^2 + 2(n/2)^2..... ans so on 0 votes 0 votes Nandkishor3939 commented Jan 18, 2019 reply Follow Share I took the common out 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Is the answer O(n^2)? Priyadrasta Raut answered Feb 19, 2019 Priyadrasta Raut comment Share Follow See 1 comment See all 1 1 comment reply rish1602 commented Jun 16, 2021 reply Follow Share yes its correct 0 votes 0 votes Please log in or register to add a comment.