Question

What is the complexity for the recurrence relation: T(n) = 2T(n/2) + 5n^2

score 1.3k · Answer 1 · 2026-03-25 12:54:03

1.3k

Views

What is the complexity for the recurrence relation: T(n) = 2T(n/2) + 5n^2

Published on 25 Mar 2026 - 12:54

score 38 · Answer 2 · 2020-02-24 18:39:13

38

Views

Solving the recurrence relation $f(n) = k f(n-1) - f(n-2)$

Published on 24 Feb 2020 - 18:39

score 39 · Answer 3 · 2020-02-25 01:34:21

39

Views

The roots of a second order recurrence relation $a_n = A a_{n-1} + B a_{n-2}$

Published on 25 Feb 2020 - 1:34

score 48 · Answer 4 · 2020-02-25 03:33:05

48

Views

Using a generating function to determine $a_n$ from a general second order recurrence relation

Published on 25 Feb 2020 - 3:33

score 60 · Answer 5 · 2020-02-27 01:38:13

60

Views

Rate of Convergence for a sequence

Published on 27 Feb 2020 - 1:38

score 4k · Answer 6 · 2026-03-27 12:03:50

4k

Views

Solving the recurrence $T(n) = 3T(n/4) + n\log n , T(1) = 1$

Published on 27 Mar 2026 - 12:03

score 80 · Answer 7 · 2026-03-25 07:45:43

80

Views

Why is $a_n(x) \neq 0$ for $a_n(x) = c_1 x a_{n-1}(x) + c_2 x a_{n-2}(x)$ if the discriminant of the characteristic polynomial $\Delta_{\lambda} > 0$?

Published on 25 Mar 2026 - 7:45

score 22 · Answer 8 · 2020-02-27 11:37:28

22

Views

On the convergence of a linear difference equation with constant coefficients

Published on 27 Feb 2020 - 11:37

score 373 · Answer 9 · 2026-03-26 12:38:28

373

Views

Find a recurrence relation and give initial conditions for the number of words of length $n$ that do not contain two consecutive vowels.

Published on 26 Mar 2026 - 12:38

score 137 · Answer 10 · 2026-03-25 07:43:12

137

Views

Using characteristic polynomial for getting an asymptotic information to a recurrence relation with non-constant coefficient

Published on 25 Mar 2026 - 7:43

score 1k · Answer 11 · 2026-03-27 18:19:14

1k

Views

How to construct a closed form formula for a recursive sequence?

Published on 27 Mar 2026 - 18:19

score 171 · Answer 12 · 2020-02-28 10:56:33

171

Views

Understanding Gauss elimination for recurrence relation

Published on 28 Feb 2020 - 10:56

score 119 · Answer 13 · 2020-02-28 17:32:10

119

Views

Total cost at a depth of i for $T(n) = 4T(n/2 + 2) + n$

Published on 28 Feb 2020 - 17:32

score 61 · Answer 14 · 2020-02-28 21:29:27

61

Views

sequence with 4 multiple difference of previous two values

Published on 28 Feb 2020 - 21:29

score 39 · Answer 15 · 2020-02-29 09:34:30

39

Views

How do I solve this recurrence relation coming from a differential equation?

Published on 29 Feb 2020 - 9:34

List Question

What is the complexity for the recurrence relation: T(n) = 2T(n/2) + 5n^2

Solving the recurrence relation $f(n) = k f(n-1) - f(n-2)$

The roots of a second order recurrence relation $a_n = A a_{n-1} + B a_{n-2}$

Using a generating function to determine $a_n$ from a general second order recurrence relation

Rate of Convergence for a sequence

Solving the recurrence $T(n) = 3T(n/4) + n\log n , T(1) = 1$

Why is $a_n(x) \neq 0$ for $a_n(x) = c_1 x a_{n-1}(x) + c_2 x a_{n-2}(x)$ if the discriminant of the characteristic polynomial $\Delta_{\lambda} > 0$?

On the convergence of a linear difference equation with constant coefficients

Find a recurrence relation and give initial conditions for the number of words of length $n$ that do not contain two consecutive vowels.

Using characteristic polynomial for getting an asymptotic information to a recurrence relation with non-constant coefficient

How to construct a closed form formula for a recursive sequence?

Understanding Gauss elimination for recurrence relation

Total cost at a depth of i for $T(n) = 4T(n/2 + 2) + n$

sequence with 4 multiple difference of previous two values

How do I solve this recurrence relation coming from a differential equation?

Trending Questions

Popular # Hahtags

Popular Questions