Register

What will be the Complexity for the recurrence relation
closed

• closed by
2,546 views
1 votes
1 votes
closed with the note: Done

T(n) = 2T(n/2) + log n

By substitution 

T(n) = 4T(n/4) + 2log n/2 + logn

I got stucked here

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
Himanshu Goyal asked Oct 12, 2016
1,240 views
What will be the time complexity of recurrence relation T(n)=c+T(n-1) using substitution method?
What will be the solution of the recurrence relation $T(n)=c+T(n-1)$ using substitution method? c is a constant here.
What will be the solution of the recurrence relation $T(n)=c+T(n-1)$ using substitution method?c is a constant here.
User Avatar
5 votes
5 votes
1 answer
2
piyushkr asked Dec 23, 2015
5,086 views
What will be the time complexity of recurrence relation T(n)=2T(n-1)+c using substitution method?
Where c is constant.
Where c is constant.
User Avatar
0 votes
0 votes
4 answers
3
Ankitrana asked Mar 23, 2016
759 views
what will be the time complexity for the below question ?
Let an array A[1,....n] has n elements, and every element of an array is less than or equal to n. An element is said to be "majority element" if it is occurred in more than n/2 positions of an array. what is the time complexity to check whether the majority element exist or not?
Let an array A[1,....n] has n elements, and every element of an array is less than or equal to n. An element is said to be "majority element" if it is occurred in more th...
User Avatar
Link Copied!