Format filest o fix linter

Author: kelvins

Diff for: README.md

@@ -1010,7 +1010,7 @@ In order to achieve greater coverage and encourage more people to contribute to
                 </a>
             </td>
             <td> <!-- Python -->
-                <a href="./src/python/fibonacci_recursiva.py">
+                <a href="./src/python/fibonacci_recursive.py">
                     <img align="center" height="25" src="./logos/python.svg" />
                 </a>
             </td>

Diff for: src/go/fibonacci_iterative.go

@@ -3,18 +3,18 @@ package main
 import "fmt"
 
 func Fibonacci(n int) int {
-    if n <= 1 {
-        return 1
-    }
+	if n <= 1 {
+		return 1
+	}
 
-    a, b := 1, 1
-    for i := 2; i <= n; i++ {
-        a, b = b, a+b
-    }
-    return b
+	a, b := 1, 1
+	for i := 2; i <= n; i++ {
+		a, b = b, a+b
+	}
+	return b
 }
 
 func main() {
-    n := 9
-    fmt.Println("Fibonacci Iterative:", Fibonacci(n))
+	n := 9
+	fmt.Println("Fibonacci Iterative:", Fibonacci(n))
 }

Diff for: src/go/fibonacci_memoization.go

@@ -5,22 +5,22 @@ import "fmt"
 var memo = make(map[int]int)
 
 func Fibonacci(n int) int {
-    if n <= 1 {
-        return 1
-    }
+	if n <= 1 {
+		return 1
+	}
 
-    // Check if the value is already memoized
-    if val, ok := memo[n]; ok {
-        return val
-    }
+	// Check if the value is already memoized
+	if val, ok := memo[n]; ok {
+		return val
+	}
 
-    // Calculate Fibonacci recursively and store the result in memoization
-    result := Fibonacci(n-1) + Fibonacci(n-2)
-    memo[n] = result
-    return result
+	// Calculate Fibonacci recursively and store the result in memoization
+	result := Fibonacci(n-1) + Fibonacci(n-2)
+	memo[n] = result
+	return result
 }
 
 func main() {
-    n := 9
-    fmt.Println("Fibonacci Memoization:", Fibonacci(n))
+	n := 9
+	fmt.Println("Fibonacci Memoization:", Fibonacci(n))
 }

Diff for: src/java/FibonacciMemoization.java

@@ -2,28 +2,28 @@
 
 public class Fibonacci {
 
-    // Create a memoization HashMap to store computed Fibonacci values
-    private static HashMap<Integer, Integer> memo = new HashMap<>();
+  // Create a memoization HashMap to store computed Fibonacci values
+  private static HashMap<Integer, Integer> memo = new HashMap<>();
 
-    public static void main(String[] args) {
-        int n = 16;
-        System.out.println("Fib(" + n + ") : " + fibonacci(n));
-    }
+  public static void main(String[] args) {
+    int n = 16;
+    System.out.println("Fib(" + n + ") : " + fibonacci(n));
+  }
 
-    public static int fibonacci(int n) {
-        if (n <= 1) {
-            return 1;
-        }
+  public static int fibonacci(int n) {
+    if (n <= 1) {
+      return 1;
+    }
 
-        // Check if the value is already computed and stored in the memoization HashMap
-        if (memo.containsKey(n)) {
-            return memo.get(n);
-        }
+    // Check if the value is already computed and stored in the memoization HashMap
+    if (memo.containsKey(n)) {
+      return memo.get(n);
+    }
 
-        // Calculate Fibonacci recursively and store the result in memoization
-        int result = fibonacci(n - 1) + fibonacci(n - 2);
-        memo.put(n, result);
+    // Calculate Fibonacci recursively and store the result in memoization
+    int result = fibonacci(n - 1) + fibonacci(n - 2);
+    memo.put(n, result);
 
-        return result;
-    }
+    return result;
+  }
 }

Diff for: src/java/FibonacciRecursive.java

@@ -8,5 +8,4 @@ public static int Fibonacci(int x) {
     if (x <= 1) return 1;
     else return Fibonacci(x - 1) + Fibonacci(x - 2);
   }
-
 }

Diff for: src/python/fibonacci_recursiva.py renamed to src/python/fibonacci_recursive.py

@@ -7,6 +7,7 @@
 
 import time
 
+
 def fibonacci(number):
     """Fibonnaci recursiva."""
     if number < 2:

Diff for: src/rust/fibonacci_iterative.rs

@@ -17,5 +17,9 @@ fn fibonacci(n: u32) -> u64 {
 
 fn main() {
     let index = 15;
-    println!("Fibonacci (iterative) of {} is: {}", index, fibonacci(index));
+    println!(
+        "Fibonacci (iterative) of {} is: {}",
+        index,
+        fibonacci(index)
+    );
 }

Diff for: src/rust/fibonacci_memoization.rs

@@ -21,5 +21,9 @@ fn main() {
     let index = 15;
     let mut memo: HashMap<u32, u64> = HashMap::new();
 
-    println!("Fibonacci (memoization) of {} is: {}", index, fibonacci(index, &mut memo));
+    println!(
+        "Fibonacci (memoization) of {} is: {}",
+        index,
+        fibonacci(index, &mut memo)
+    );
 }

Diff for: src/scala/FibonacciIterative.scala

@@ -6,6 +6,7 @@ object FibonacciIterative {
 
     var a = BigInt(0)
     var b = BigInt(1)
+
     var result = BigInt(0)
 
     for (i <- 2 to n) {