10 Oct 2017 - 6:53pm

T(n)= T(n/2)+T(n/2) + n +n for linked list

On solving,

O(nlogn) ?

 

 

more less
1 Jan 2017 - 4:13pm

There are different methods for time complexity of recurence relation:

1.Substitution

2.Tree method

3.Master theorem

 

more less