Return any (big) fibonacci number

My solutions for CODEWARS: A collection of TDD katas (simple programs) written in JavaScript, Python, and more to learn and have fun!

This project explores recursion through two classic computer science problems: Fibonacci Sequence and Merge Sort. Both examples demonstrate how a problem can be broken down into smaller subproblems, the essence of recursive thinking.

フィボナッチのカウントアップ

Evaluate a Fibonacci polynomial.

Evaluate a Lucas polynomial.

Maximum safe Fibonacci number when stored in double-precision floating-point format.

Maximum safe Fibonacci number when stored in single-precision floating-point format.

recursion tests

Exercícios de implementação de Estrutura de Dados em JavaScript. Utilizando dos conhecimentos no curso The Odin Project

Maximum safe nth Fibonacci number when stored in double-precision floating-point format.

A collection of classic algorithms and data structure implementations in JavaScript, built from scratch for learning and mastery.

Maximum safe Lucas number when stored in single-precision floating-point format.

Maximum safe nth Lucas number when stored in single-precision floating-point format.

Maximum safe Lucas number when stored in double-precision floating-point format.

Create an iterator which generates a non-Fibonacci integer sequence.

Create an iterator which generates a negaLucas sequence.

solutions for the computer science section of The Odin Project

My solutions to The Odin Project's assignments for Computer Science lessons

Create an iterator which generates a negaFibonacci sequence.