The Gateway to Computer Science Excellence
0 votes
120 views

I am unable to Find its time complexity using Iterative method…

Will any one help me out with this .

Thank you :)

in Algorithms by Active (1.3k points) | 120 views
0
This one is like divide and conquer paradigm , apply Master's theorem
0
Can you find its answer without using Masters theorem
0
I'll try :)
0

I got stuck here :p

0
You forgot to multiply with coefficients , it will be n^2 + 2(n/2)^2..... ans so on
0
I took the common out

1 Answer

0 votes
Is the answer O(n^2)?
by Junior (511 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,648 questions
56,459 answers
195,337 comments
100,190 users