Question

Explanation needed on this rather basic recurrence solution

score 193 · Answer 1 · 2013-01-15 21:50:51

193

Views

Explanation needed on this rather basic recurrence solution

Published on 15 Jan 2013 - 21:50

score 246 · Answer 2 · 2013-01-17 22:14:06

246

Views

Basic recurrence problem, not sure if solution is correct (solution included)

Published on 17 Jan 2013 - 22:14

score 2k · Answer 3 · 2013-01-18 08:20:41

2k

Views

Is this formula for the number of nodes for a complete tree or a full and complete tree?

Published on 18 Jan 2013 - 8:20

score 1.3k · Answer 4 · 2013-01-19 03:55:12

1.3k

Views

Finding an approximate diagonal in a grid

Published on 19 Jan 2013 - 3:55

score 20.3k · Answer 5 · 2013-01-21 23:16:32

20.3k

Views

Proof by the substitution method that if $T(n) = T(n - 1) + \Theta(n)$ then $T(n)=\Theta(n^2)$

Published on 21 Jan 2013 - 23:16

score 3.7k · Answer 6 · 2013-01-27 14:42:14

3.7k

Views

Solving recurrences with boundary conditions

Published on 27 Jan 2013 - 14:42

score 211 · Answer 7 · 2013-01-29 12:57:50

211

Views

Recursive relation, how to calculate the period of repeating pattern

Published on 29 Jan 2013 - 12:57

score 1.6k · Answer 8 · 2026-03-27 01:14:04

1.6k

Views

Recursive FFT java implementation

Published on 27 Mar 2026 - 1:14

score 178 · Answer 9 · 2026-03-28 14:37:04

178

Views

Recursive functions, successor function

Published on 28 Mar 2026 - 14:37

score 354 · Answer 10 · 2026-03-28 14:37:05

354

Views

Recursive relation using successor function

Published on 28 Mar 2026 - 14:37

score 100 · Answer 11 · 2013-02-03 20:43:17

100

Views

Find a closed form for the recurrence relation $h_{n}=h_{n-1}+(n-1)+\sum_{k=1}^{n-1} {n-2 \choose k-1}h_{k-1}$

Published on 03 Feb 2013 - 20:43

score 135 · Answer 12 · 2013-02-10 05:27:23

135

Views

Recursive Series

Published on 10 Feb 2013 - 5:27

score 71 · Answer 13 · 2013-02-10 06:10:50

71

Views

Recursive Definitions - Should I use logic notation (i.e. arrows or "for n =...")

Published on 10 Feb 2013 - 6:10

score 3.1k · Answer 14 · 2013-02-10 06:55:45

3.1k

Views

What does "give a recursive definition of the set of polynomials with integer coefficients", mean?

Published on 10 Feb 2013 - 6:55

score 281 · Answer 15 · 2013-02-11 14:56:48

281

Views

How to create equations to measure time spending in executing algorithms?

Published on 11 Feb 2013 - 14:56

List Question

Explanation needed on this rather basic recurrence solution

Basic recurrence problem, not sure if solution is correct (solution included)

Is this formula for the number of nodes for a complete tree or a full and complete tree?

Finding an approximate diagonal in a grid

Proof by the substitution method that if $T(n) = T(n - 1) + \Theta(n)$ then $T(n)=\Theta(n^2)$

Solving recurrences with boundary conditions

Recursive relation, how to calculate the period of repeating pattern

Recursive FFT java implementation

Recursive functions, successor function

Recursive relation using successor function

Find a closed form for the recurrence relation $h_{n}=h_{n-1}+(n-1)+\sum_{k=1}^{n-1} {n-2 \choose k-1}h_{k-1}$

Recursive Series

Recursive Definitions - Should I use logic notation (i.e. arrows or "for n =...")

What does "give a recursive definition of the set of polynomials with integer coefficients", mean?

How to create equations to measure time spending in executing algorithms?

Trending Questions

Popular # Hahtags

Popular Questions