Skip to Content
Learning JavaScript Data Structures and Algorithms - Third Edition
book

Learning JavaScript Data Structures and Algorithms - Third Edition

by Loiane Avancini
April 2018
Beginner to intermediate content levelBeginner to intermediate
426 pages
10h 19m
English
Packt Publishing
Content preview from Learning JavaScript Data Structures and Algorithms - Third Edition

The Fibonacci sequence

The Fibonacci sequence is another problem that we can solve using recursion. It is a series of the numbers 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on. The number 2 is found by adding 1 + 1. The number 3 is found by adding 1 + 2, 5 is found by adding 2 + 3, and so on! The Fibonacci sequence can be defined as follows:

  1. The Fibonacci number at position 0 is 0.
  2. The Fibonacci number at position 1 or 2 is 1.
  3. The Fibonacci number at position n (for n > 2) is the Fibonacci of (n - 1) + Fibonacci of (n - 2).
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning JavaScript Data Structures and Algorithms

Learning JavaScript Data Structures and Algorithms

Loiane Avancini

Publisher Resources

ISBN: 9781788623872Supplemental Content