Question

Is the runtime complexity $Θ\left(n^2lg\ n\right)$ for this recurrence relation $T\left(n\right)\ =\ 4T\left(\frac{n}{2}\right)\ +\ n^2\sqrt{n}$?

score 224 · Answer 1 · 2026-03-28 01:48:50

Is the runtime complexity $Θ\left(n^2lg\ n\right)$ for this recurrence relation $T\left(n\right)\ =\ 4T\left(\frac{n}{2}\right)\ +\ n^2\sqrt{n}$?

score 82 · Answer 2 · 2026-03-28 01:48:13

82

Views

What is the runtime complexity for this recurrence relation $T\left(n\right)\ =\ 2T\left(\frac{n}{2}\right)\ +\ n\ lg\ n$?

Published on 28 Mar 2026 - 1:48

score 5.2k · Answer 3 · 2019-07-17 03:22:36

5.2k

Views

Solving recurrence $T(n) = 4T(n/2)+ n^2+ n$ by master theorem

Published on 17 Jul 2019 - 3:22

score 120 · Answer 4 · 2026-03-28 01:48:25

120

Views

Is $n\ \log_2\left(n\right)\ ∈\ Ω\left(n^{1.001}\right)$?

Published on 28 Mar 2026 - 1:48

score 302 · Answer 5 · 2026-03-26 00:58:22

302

Views

How to find a recurrence relation for this recursive algorithm?

Published on 26 Mar 2026 - 0:58

score 69 · Answer 6 · 2026-02-25 11:19:33

69

Views

No common terms in two sequences defined by linear quadratic recurrence relations

Published on 25 Feb 2026 - 11:19

score 214 · Answer 7 · 2026-03-25 19:17:40

214

Views

Uniqueness Difference Riccati Equation

Published on 25 Mar 2026 - 19:17

score 410 · Answer 8 · 2026-03-26 04:50:07

410

Views

Recurrence relation for the Thue–Morse sequence

Published on 26 Mar 2026 - 4:50

score 134 · Answer 9 · 2026-03-27 14:57:35

134

Views

Find a formula for a recursion

Published on 27 Mar 2026 - 14:57

score 362 · Answer 10 · 2026-03-27 11:48:13

362

Views

Finding a closed form for recurrence relations $a_n=na_{n-1}+1$ and $a_n=na_{n-1}+n$

Published on 27 Mar 2026 - 11:48

score 80 · Answer 11 · 2019-07-22 06:01:24

80

Views

For what $~K~$ does $~n~$ exist for all $~n\ge k~$ if $~n=6X+10Y+25Z~$ where $~n~$ and $~k~$ are natural numbers?

Published on 22 Jul 2019 - 6:01

score 39 · Answer 12 · 2026-03-26 22:14:54

39

Views

$x_{\alpha+1} = 2 (g(x_\alpha)) $ prove orbit reaches $2^p$

Published on 26 Mar 2026 - 22:14

score 25 · Answer 13 · 2019-07-22 12:00:54

25

Views

Solving 2-d recurrence relation with two expressions

Published on 22 Jul 2019 - 12:00

score 44 · Answer 14 · 2019-07-22 19:34:43

If sequences $\{a_k\}$ and $\{b_k\}$ are related by $a_k = \sum_{r=0}^k \binom{k}{r} b_r$, can I compute $b_k$s in $O(1)$ time?

score 289 · Answer 15 · 2019-07-23 07:18:46

289

Views

Probability of seeds germinating

Published on 23 Jul 2019 - 7:18

List Question

Is the runtime complexity $Θ\left(n^2lg\ n\right)$ for this recurrence relation $T\left(n\right)\ =\ 4T\left(\frac{n}{2}\right)\ +\ n^2\sqrt{n}$?

What is the runtime complexity for this recurrence relation $T\left(n\right)\ =\ 2T\left(\frac{n}{2}\right)\ +\ n\ lg\ n$?

Solving recurrence $T(n) = 4T(n/2)+ n^2+ n$ by master theorem

Is $n\ \log_2\left(n\right)\ ∈\ Ω\left(n^{1.001}\right)$?

How to find a recurrence relation for this recursive algorithm?

No common terms in two sequences defined by linear quadratic recurrence relations

Uniqueness Difference Riccati Equation

Recurrence relation for the Thue–Morse sequence

Find a formula for a recursion

Finding a closed form for recurrence relations $a_n=na_{n-1}+1$ and $a_n=na_{n-1}+n$

For what $~K~$ does $~n~$ exist for all $~n\ge k~$ if $~n=6X+10Y+25Z~$ where $~n~$ and $~k~$ are natural numbers?

$x_{\alpha+1} = 2 (g(x_\alpha)) $ prove orbit reaches $2^p$

Solving 2-d recurrence relation with two expressions

If sequences $\{a_k\}$ and $\{b_k\}$ are related by $a_k = \sum_{r=0}^k \binom{k}{r} b_r$, can I compute $b_k$s in $O(1)$ time?

Probability of seeds germinating

Trending Questions

Popular # Hahtags

Popular Questions