 acbrent25
9/4/2017 - 4:42 PM

## Fibonacci Sequence Using Recursive Function Take an integer n and return the first nth numbers of the Fibonacci Sequence.

Fibonacci Sequence Using Recursive Function

Take an integer n and return the first nth numbers of the Fibonacci Sequence.

``````<!DOCTYPE html>

<html lang="en-us">

<meta charset="UTF-8">

<title>Document</title>

<body>

<script src="recursiveFibSolution.js"></script>

</body>

</html>``````
``````// 1 1 2 3 5 8 13 21

// Function to return the Fibonacci Sequence to a given number of places (n)
var fibonacci = function(n) {

// Blank array to hold result

// Loop to pass the desired place into the recursive function to determine the Fibonacci Number at that position
for (var i = 1; i < n + 1; i++) {

// pushes the calculated Fibonacci Number into the array

}

};

// Function which takes an integer as an argument (i) which is a place in the Fibonacci Sequence
var recursive = function(i) {

// Triggered when calculating the 1st and 0th places, simply returns 1 for the 1st position and 0 for the 0th
if (i < 2) {
return i;
}
else {

// Run recursive on the two places before the current one
return recursive(i - 1) + recursive(i - 2);
}
};``````