feat: recursiveFibonacci

README.md

@@ -1,7 +1,7 @@
 # 201flaviosilva-UtilsJS
 
 ## Description
-Just some simple JavaScript Utils. Some of the functions was create to solve a challenge in [Code Wars](https://www.codewars.com/dashboard).
+Just some simple JavaScript Utils.
 
 ## Usage
 

src/CSS/reset.css

@@ -33,8 +33,10 @@ textarea {
 button,
 a,
 label,
+input,
 select,
-option {
+option,
+textarea {
   cursor: pointer;
 }
 

src/Fibonacci.js

@@ -123,3 +123,19 @@ export function fibonacciCustomSequence(start = 1, end = 100) {
 
 	return sequence;
 }
+
+
+/**
+ * A other way to solve the fibonacci sequence, with recursion.
+ * 
+ * @example recursiveFibonacci(5); // 5
+ * @example recursiveFibonacci(8); // 21
+ * @example recursiveFibonacci(10); // 55
+ * 
+ * @param {number} terms - number of terms
+ * @returns {number}
+ */
+export function recursiveFibonacci(terms) {
+	if (terms <= 1) return terms;
+	return recursiveFibonacci(terms - 1) + recursiveFibonacci(terms - 2);
+}

src/index.js

@@ -16,7 +16,7 @@ import { degreesToRadians } from "./degreesToRadians.js";
 import { division } from "./division.js";
 import { EventSystem, EventSystemInstance } from "./EventSystem.js";
 import { exportFile } from "./exportFile.js";
-import { Fibonacci, fibonacciSequence, fibonacciUntil, fibonacciCustomSequence } from "./Fibonacci.js";
+import { Fibonacci, fibonacciSequence, fibonacciUntil, fibonacciCustomSequence, recursiveFibonacci } from "./Fibonacci.js";
 import { FIFO } from "./FIFO.js";
 import { findBigArrObj } from "./findBigArrObj.js";
 import { findLowArrObj } from "./findLowArrObj.js";
@@ -81,7 +81,7 @@ export {
 	division,
 	EventSystem, EventSystemInstance,
 	exportFile,
-	Fibonacci, fibonacciSequence, fibonacciUntil, fibonacciCustomSequence,
+	Fibonacci, fibonacciSequence, fibonacciUntil, fibonacciCustomSequence, recursiveFibonacci,
 	FIFO,
 	findBigArrObj,
 	findLowArrObj,