search
Log In
0 votes
162 views

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

Will any one help me out with this .

Thank you :)

in Algorithms 162 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)?

Related questions

0 votes
0 answers
1
140 views
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
asked Jan 6, 2019 in Algorithms Markzuck 140 views
0 votes
0 answers
2
192 views
The difference of time Complexity between given functions can be represented by: void fun1(int n) { for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) if(j%i==0) for(int k=1;k<=j;k++) s++; return 0; } void fun2(int n) { for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) for(int k=1;k<=j;k++) s++; return 0; } $i. O(n^2)$ $ii. O(n)$ $iii.O(1)$ $iv. O(n^{1.5})$
asked Jan 4, 2019 in Algorithms shreyansh jain 192 views
0 votes
1 answer
3
558 views
What will be the worst case time complexity for the following code segment? int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } } Options: O(N^4) O(N^3) O(N^2) O(N)
asked Jan 4, 2019 in Algorithms saptarshiDey 558 views
0 votes
0 answers
4
218 views
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c, like cant we take both the recurrance call as combined as both have same parameter? and if not, then how to solve such?
asked Dec 29, 2018 in Algorithms Markzuck 218 views
...