From e2413246ea3be0654950920115021446cc5b1bed Mon Sep 17 00:00:00 2001
From: Wimukthi Rajapaksha <wimukthirajapaksha@Wimukthis-MacBook-Pro.local>
Date: Sat, 5 Nov 2022 03:47:53 +0530
Subject: [PATCH] Added another fibonacci calculation method and time
 complexities.

---
 src/algo/dp/FibonacciNumber.java | 15 +++++++++++++--
 1 file changed, 13 insertions(+), 2 deletions(-)

diff --git a/src/algo/dp/FibonacciNumber.java b/src/algo/dp/FibonacciNumber.java
index 29ec894..d77ea71 100644
--- a/src/algo/dp/FibonacciNumber.java
+++ b/src/algo/dp/FibonacciNumber.java
@@ -5,7 +5,7 @@
  */
 public class FibonacciNumber {
 
-    int fib(int n) {
+    int fib(int n) { // TIME COMPLEXITY -> O(N), SPACE COMPLEXITY -> O(1)
         if (n <= 0) return 0;
         if (n == 1 || n == 2) return 1;
         int f1 = 1;
@@ -18,7 +18,18 @@ int fib(int n) {
         return f1;
     }
 
-    int fibonacci(int[] a, int n) {
+    public int fibUsingArr(int n) { // TIME COMPLEXITY -> O(N), SPACE COMPLEXITY -> O(N)
+        if(n==0 || n==1) return n;
+        int[] arr=new int[n+1];
+        arr[0]=0;
+        arr[1]=1;
+        for(int i=2; i<arr.length; i++) {
+            arr[i]=arr[i-1]+arr[i-2];
+        }
+        return arr[arr.length-1];
+    }
+
+    int fibonacci(int[] a, int n) { // TIME COMPLEXITY -> O(N^2), SPACE COMPLEXITY -> O(N)
         if (n <= 0) return 0;
         if (n == 1 || n == 2) return 1;
         if (a[n] != 0) return a[n];