From 7a445d0e1334b68d496a2274feda5099d15d6c19 Mon Sep 17 00:00:00 2001
From: 4kpros <prosper.abouar@gmail.com>
Date: Sat, 22 Oct 2022 00:23:11 +0100
Subject: [PATCH] Add time complexity of Fibonacci with recursion

---
 algorithms/CPlusPlus/Recursion/fibonacci.cpp | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/algorithms/CPlusPlus/Recursion/fibonacci.cpp b/algorithms/CPlusPlus/Recursion/fibonacci.cpp
index 30e2953d..45591a4e 100644
--- a/algorithms/CPlusPlus/Recursion/fibonacci.cpp
+++ b/algorithms/CPlusPlus/Recursion/fibonacci.cpp
@@ -1,20 +1,24 @@
 /*
     Description: Program to calculate fibonacci using recursion
+
+    Time complexity: O(2^n) where n is the number
 */
 #include <iostream>
 using namespace std;
 
+//Recursive function with integer parameter
 int RecursiveFibonacci(int number)
 {
-    if(number == 1 || number == 2)
+    if(number == 0 || number == 1)
         return 1;
 
-    if(number >= 3)
+    if(number >= 2)
         return RecursiveFibonacci(number - 1) + RecursiveFibonacci(number - 2);
         
     return 0;
 }
 
+//Main function
 int main(int argc, char *argv[])
 {
     int number = 10;