Minor edit

Author: AllThingsSmitty

README.md

@@ -136,18 +136,16 @@ console.log(fibonacci(6)); // Output: 8
 
 **Explanation**: Generates the nth Fibonacci number recursively by summing the two preceding numbers.
 
-<sup>[Back to top](#algorithms)</sup>
-
 ⚠️ **Note**: This approach has exponential time complexity `O(2^n)` and is inefficient for large inputs.
 
+<sup>[Back to top](#algorithms)</sup>
+
 ### Factorial of a Number
 
 ```js
 function factorial(n) {
   if (n < 0) throw new RangeError('Factorial is not defined for negative numbers');
-
   if (n === 0 || n === 1) return 1;
-
   return n * factorial(n - 1);
 }