About

I am too Lazy to update about me.

Role

Alma Mater:

Not updated.

Experience:

Not updated.
Babytud
Answer
9 months 1 week ago

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

On solving,

O(nlogn) ?

 

 

moreless
Babytud
Answer
1 year 6 months ago

There are different methods for time complexity of recurence relation:

1.Substitution

2.Tree method

3.Master theorem

 

moreless
thegatebook's picture
KIRAN KUMAR
sumitverma's picture
Sumit Verma
virtualgate's picture
Virtual GATE
pritam's picture
Pritam Prasun
techtud's picture
Techtud Admin

<div class="tex2jax">Oops...!! No one is following you.</div>

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