I am too Lazy to update about me.

Not updated.

### Experience:

Not updated.
Babytud
9 months 1 week ago

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

On solving,

O(nlogn) ?

moreless
Babytud
1 year 6 months ago

There are different methods for time complexity of recurence relation:

1.Substitution

2.Tree method

3.Master theorem

moreless
Babytud
Multichoice
1 year 6 months ago

\begin{aligned}S&= \frac{1}{2}+ \frac{3}{4}+ \frac{5}{8}+ \frac{7}{16}+\cdots\\ \frac{1}{2}S&= \frac{1}{4}+ \frac{3}{8}+ \frac{5}{16}+ \frac{7}{32}+\cdots\\ \text{So }&\\S-\frac{1}{2} S&= \frac{1}{2}+ \frac{2}{4}+ \frac{2}{8}+ \frac{2}{16}+\cdots\\ \frac{1}{2}S&= \frac{1}{2}+ \frac{1}{2}+ \frac{1}{4}+ \frac{1}{8}+\cdots\\ \frac{1}{2}S&=\frac{1}{2}+1=\frac{3}{2}\\ \text{or }S&= 3\end{aligned}

moreless
KIRAN KUMAR
Sumit Verma
Virtual GATE
Pritam Prasun

<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