Fix Fibonacci in Swift

Author: kelvins

src/swift/fibonacci2.swift

@@ -1,21 +1,21 @@
 // Function to calculate Fibonacci numbers iteratively
-func fibonacciIterative(_ number: Int) -> Int {
+func fibonacci(_ number: Int) -> Int {
     if number <= 1 {
         return number
     } else {
         var currentNumber: Int = 1
         var nextNumber: Int = 0
-        
+
         // Iterate from 0 to 'number - 1'
         for _ in 0..<number {
             let tempNumber = nextNumber
             nextNumber = nextNumber + currentNumber
             currentNumber = tempNumber
         }
-        
+
         return currentNumber
     }
 }
 
 let index: Int = 15
-print("Fibonacci (iterative):", fibonacciIterative(index))
+print("Fibonacci (iterative):", fibonacci(index))

src/swift/fibonacciIterative.swift

@@ -2,7 +2,7 @@
 var memo: [Int: Int] = [:]
 
 // Function to calculate Fibonacci numbers using memoization
-func fibonacciMemoization(_ n: Int) -> Int {
+func fibonacci(_ n: Int) -> Int {
     if n <= 1 {
         return n
     }
@@ -13,11 +13,11 @@ func fibonacciMemoization(_ n: Int) -> Int {
     }
 
     // Calculate Fibonacci recursively and store the result in memoization
-    let result = fibonacciMemoization(n - 1) + fibonacciMemoization(n - 2)
+    let result = fibonacci(n - 1) + fibonacci(n - 2)
     memo[n] = result
 
     return result
 }
 
 let index: Int = 15
-print("Fibonacci (memoization):", fibonacciMemoization(index))
+print("Fibonacci (memoization):", fibonacci(index))

src/swift/fibonacciMemoization.swift

@@ -1,12 +1,12 @@
 // Function to calculate Fibonacci numbers recursively
-func fibonacciRecursive(_ number: Int) -> Int {
+func fibonacci(_ number: Int) -> Int {
     if number <= 1 {
         return number
     } else {
         // Recursively calculate Fibonacci using the formula F(n) = F(n-1) + F(n-2)
-        return fibonacciRecursive(number - 1) + fibonacciRecursive(number - 2)
+        return fibonacci(number - 1) + fibonacci(number - 2)
     }
 }
 
 let index: Int = 15
-print("Fibonacci (recursive):", fibonacciRecursive(index))
+print("Fibonacci (recursive):", fibonacci(index))