Revision as of 23:29, 8 August 2018

Internal

We define Fibonacci numbers by the following recurrence:

F₀ = 0

F₁ = 1

F_i = F_i-1 + F_i-2 for i ≥ 2.

TODO CLRS page 108.

Revision as of 21:00, 8 August 2018 (view source) Ovidiu (talk \| contribs) (→‎Overview) ← Older edit		Revision as of 23:29, 8 August 2018 (view source) Ovidiu (talk \| contribs) (→‎Overview) Newer edit →
Line 12:		Line 12:

	F<sub>i</sub> = F<sub>i-1</sub> + F<sub>i-2</sub> for i ≥ 2.		F<sub>i</sub> = F<sub>i-1</sub> + F<sub>i-2</sub> for i ≥ 2.

			<font color=darkgray>TODO [[CLRS]] page 108.</font>