query: Solving $T(n)= 2T(n/2)+n \lg (n)$
positive_passages.docid: 121248
positive_passages.text: How to solve this recurrence $T(n) = 2T(n/2) + n\log n$
negative_passages.docid: 153692
negative_passages.text: Generating and solving recurrence relations
negative_passages.docid: 91684
negative_passages.text: Prove the following equation(much needed help):
negative_passages.docid: 61871
negative_passages.text: Formula for the $n$th term of $1, 2, 2, 3, 3, 3, 4, 4 ,4, 4, 5, ...$
negative_passages.docid: 43327
negative_passages.text: convoluted recurrence: $f(2n)=f(n)+f(n+1)+n, f(2n+1)=f(n)+f(n-1)+1$
negative_passages.docid: 144890
negative_passages.text: Recurrence $f_{n+2}=af_{n+1}+bf_n$
negative_passages.docid: 74532
negative_passages.text: Solve for $ A $ from $ A {A}^{T} $
negative_passages.docid: 49192
negative_passages.text: Technique for finding the nth term
negative_passages.docid: 52324
negative_passages.text: Tight bound for $T(n) = T(n^{1/2}) + 1$
negative_passages.docid: 81371
negative_passages.text: Solving recurrence $T(n) = T(\lceil n/2 \rceil) + T(\lfloor n/2 \rfloor) + \Theta(n)$
negative_passages.docid: 72557
negative_passages.text: Prove that $T(n) = T(n/3) + T2n/3) + 5n$ is $O(n log n)$
negative_passages.docid: 94407
negative_passages.text: Number of solutions for $x[1] + x[2] + \ldots + x[n] =k$
negative_passages.docid: 43066
negative_passages.text: Finding value of $S-T$ in $2$ binomial sum.
negative_passages.docid: 128004
negative_passages.text: Does DTIME(O(n)) = REGULAR?
negative_passages.docid: 13418
negative_passages.text: Solve the recurrence
negative_passages.docid: 52377
negative_passages.text: Find the linear recurrence of degree at most 2 for the following sequence
negative_passages.docid: 48949
negative_passages.text: Solving a Diophantine equation with a large solution