Fix fibonacci CPP

Author: kelvins

src/cpp/FibonacciIterative.cpp

@@ -1,22 +1,18 @@
-
 #include <iostream>
 
 using namespace std;
 
-int fibonacciIterative(int n)
-{
+int fibonacci(int n) {
     int last = 0;
     int curr = 1;
-    for (int index = 0; index < n; ++index)
-    {
+    for (int index = 0; index < n; ++index) {
         int temp = curr;
         curr += last;
         last = temp;
     }
     return last;
 }
 
-int main()
-{
-    cout << fibonacciIterative(12) << endl;
+int main() {
+    cout << fibonacci(12) << endl;
 }

src/cpp/FibonacciMemoization.cpp

@@ -5,15 +5,15 @@ using namespace std;
 
 vector<int> memo;
 
-int fibonacciMemoization(int n) {
+int fibonacci(int n) {
     if (n <= 1) {
         return n;
     }
     if (memo[n] != -1) {
         return memo[n];
     }
 
-    memo[n] = fibonacciMemoization(n - 1) + fibonacciMemoization(n - 2);
+    memo[n] = fibonacci(n - 1) + fibonacci(n - 2);
     return memo[n];
 }
 
@@ -23,6 +23,6 @@ int main() {
     // Initialize the memoization table with -1 (uncomputed)
     memo.assign(test_nbr + 1, -1);
 
-    cout << "memoization: " << fibonacciMemoization(test_nbr) << endl;
+    cout << "memoization: " << fibonacci(test_nbr) << endl;
     return 0;
 }

src/cpp/FibonacciRecursive.cpp

@@ -1,25 +1,14 @@
-
 #include <iostream>
 
 using namespace std;
 
-int fibonacciRecursive(int n)
-{
-    if (n == 0)
-    {
-        return 0;
-    }
-    else if (n == 1)
-    {
-        return 1;
-    }
-    else
-    {
-        return fibonacciRecursive(n-1) + fibonacciRecursive(n-2);
+int fibonacci(int n) {
+    if (n <= 1) {
+        return n;
     }
+    return fibonacci(n-1) + fibonacci(n-2);
 }
 
-int main()
-{
-    cout << fibonacciRecursive(12) << endl;
+int main() {
+    cout << fibonacci(12) << endl;
 }