diff --git a/README.md b/README.md
index 940c508a5..6e58830e2 100644
--- a/README.md
+++ b/README.md
@@ -1108,8 +1108,8 @@ console.log(pulled); // [ 'b', 'd' ]
QuickSort an Array (ascending sort by default).
-Use recursion.
-Use `Array.filter` and spread operator (`...`) to create an array that all elements with values less than the pivot come before the pivot, and all elements with values greater than the pivot come after it.
+Use recursion.
+Use `Array.filter` and spread operator (`...`) to create an array that all elements with values less than the pivot come before the pivot, and all elements with values greater than the pivot come after it.
If the parameter `desc` is truthy, return array sorts in descending order.
```js
@@ -2277,7 +2277,7 @@ const factorial = n =>
fibonacci(6); // 720
+fibonacci(6); // [0, 1, 1, 2, 3, 5]
Returns the number of fibonnacci numbers up to num(0 and num inclusive).
Use a mathematical formula to calculate the number of fibonacci numbers until num.
const fibonacciCountUntilNum = num =>
Math.ceil(Math.log(num * Math.sqrt(5) + 1 / 2) / Math.log((Math.sqrt(5) + 1) / 2));
fibonacciCountUntilNum(10); // 7
@@ -845,4 +845,4 @@ console.log(sdbm('age')); // 808122783
toOrdinalSuffix('123'); // "123rd"
Returns true if the given value is a number, false otherwise.
Use !isNaN in combination with parseFloat() to check if the argument is a number. Use isFinite() to check if the number is finite. Use Number() to check if the coercion holds.
const validateNumber = n => !isNaN(parseFloat(n)) && isFinite(n) && Number(n) == n;
validateNumber('10'); // true
-