Question

If $T(0) = 0$ and $T(n>0) = 2T(n-1)+4^n+1$, what is the explicit formula (via recursion)?

score 72 · Answer 1 · 2014-10-20 18:54:33

72

Views

If $T(0) = 0$ and $T(n>0) = 2T(n-1)+4^n+1$, what is the explicit formula (via recursion)?

Published on 20 Oct 2014 - 18:54

score 72 · Answer 2 · 2026-03-27 07:47:47

72

Views

Solve recurrence relation problem

Published on 27 Mar 2026 - 7:47

score 761 · Answer 3 · 2026-03-27 12:12:17

761

Views

Imaginary solutions of a recurrence relation

Published on 27 Mar 2026 - 12:12

score 65 · Answer 4 · 2014-10-22 18:07:10

65

Views

Using a recursion tree to obtain an algorithm classification with n^2 time

Published on 22 Oct 2014 - 18:07

score 71 · Answer 5 · 2014-10-25 20:54:13

71

Views

Recursive Equation.

Published on 25 Oct 2014 - 20:54

score 61 · Answer 6 · 2014-10-26 06:54:56

61

Views

Recursion and Time Complexity Concept

Published on 26 Oct 2014 - 6:54

score 32 · Answer 7 · 2014-10-26 18:51:23

32

Views

Complexities of Recurrences in the form $t(n) = t(\alpha n) + t(\beta n) + cn$

Published on 26 Oct 2014 - 18:51

score 1.2k · Answer 8 · 2014-11-01 08:37:24

1.2k

Views

How many even numbers will $99$ dice show if we roll them forever under a certain condition?

Published on 01 Nov 2014 - 8:37

score 1.1k · Answer 9 · 2014-11-05 00:38:47

1.1k

Views

Using Master Theorem to prove a recurrence with f(n) = Θ(n/logn)

Published on 05 Nov 2014 - 0:38

score 193 · Answer 10 · 2014-11-06 23:54:25

193

Views

Solving recurrence relation $f(n) = f(\lfloor\sqrt n\rfloor) + 1; f(1) = 1, f(2) = 1$

Published on 06 Nov 2014 - 23:54

score 59 · Answer 11 · 2014-11-08 16:25:14

59

Views

How to solve $T(n)=\frac2n\sum_{i=1}^{n-1}T(i)+\Theta(n)$

Published on 08 Nov 2014 - 16:25

score 224 · Answer 12 · 2014-11-08 17:28:40

224

Views

Ways of defining a recursive function that counts right-parentheses in a string

Published on 08 Nov 2014 - 17:28

score 72 · Answer 13 · 2014-11-08 19:41:06

72

Views

How to prove that if $T(n)=\max_{1\le q \le n-1}(T(q)+T(n-q))+\Theta(n)$ then $T(n)=O(n^2)$

Published on 08 Nov 2014 - 19:41

score 826 · Answer 14 · 2014-11-10 04:53:45

826

Views

How to find explicit formula using backwards iteration

Published on 10 Nov 2014 - 4:53

score 87 · Answer 15 · 2014-11-10 10:02:38

87

Views

Solution to recursion equation: $ T(n) = T(n-1) *T(n-2) $ with $T(1) = a$, $T(2) = b$

Published on 10 Nov 2014 - 10:02

List Question

If $T(0) = 0$ and $T(n>0) = 2T(n-1)+4^n+1$, what is the explicit formula (via recursion)?

Solve recurrence relation problem

Imaginary solutions of a recurrence relation

Using a recursion tree to obtain an algorithm classification with n^2 time

Recursive Equation.

Recursion and Time Complexity Concept

Complexities of Recurrences in the form $t(n) = t(\alpha n) + t(\beta n) + cn$

How many even numbers will $99$ dice show if we roll them forever under a certain condition?

Using Master Theorem to prove a recurrence with f(n) = Θ(n/logn)

Solving recurrence relation $f(n) = f(\lfloor\sqrt n\rfloor) + 1; f(1) = 1, f(2) = 1$

How to solve $T(n)=\frac2n\sum_{i=1}^{n-1}T(i)+\Theta(n)$

Ways of defining a recursive function that counts right-parentheses in a string

How to prove that if $T(n)=\max_{1\le q \le n-1}(T(q)+T(n-q))+\Theta(n)$ then $T(n)=O(n^2)$

How to find explicit formula using backwards iteration

Solution to recursion equation: $ T(n) = T(n-1) *T(n-2) $ with $T(1) = a$, $T(2) = b$

Trending Questions

Popular # Hahtags

Popular Questions