Fibonacci

We implement two algorithms for computing the nth term of the Fibonacci sequence

$$ \begin{equation*} \forall n \in \mathbb{N}, \ u_n = \begin{cases} n & \text{if } n < 2 \\ u_{n-1} + u_{n-2} & \text{if } n \geq 2 \end{cases} \end{equation*} $$

• naive_fibonacci → $\mathcal{O}(2^n)$
• smart_fibonacci → $\mathcal{O}(n)$

Usage

• Install pixi
• Pixi for rust projects

pixi run start