Fix Fibonacci calculation input and add binary search implementation with sorting

Author: gourab04

Recursion/BS.java

@@ -0,0 +1,25 @@
+public class BS {
+    public static void main(String[] args) {
+        int arr[] = {1,2,4,5,59,80,100};
+        int target = 80;
+
+        System.out.println(binary_search(arr,0,arr.length-1,target));
+    }
+
+    static int binary_search(int arr[], int left,int right,int target){
+        if(left > right){
+            return -1;
+        }
+
+        int mid = (left+right)/2;
+
+        if(arr[mid] == target ) return mid;
+        
+        if(arr[mid] > target){
+            return binary_search(arr,left,mid-1,target);
+        }
+
+        return binary_search(arr, mid+1 , right, target);
+       
+    }
+}

Recursion/fibonacci.java

@@ -1,7 +1,7 @@
 
 public class fibonacci {
     public static void main(String[] args) {
-        int result = fib(6);
+        int result = fib(5);
         System.out.println("Fibonacci of is: " + result);
         // System.out.println(fib(5));
     }

Searching/BS.java

@@ -0,0 +1,40 @@
+
+import java.util.Arrays;
+
+public class BS {
+    public static void main(String[] args) {
+        int arr[] = {4,26,1,3,87,20 };
+        Arrays.sort(arr);
+        System.out.println("Sorted Array: " + Arrays.toString(arr));
+        int target = 26;
+        int result = binary_search(arr, target);
+
+        if (result != -1) {
+            System.out.println("Find the Element! , at index of : " + result);
+        } else {
+            System.out.println("Not found the Element ");
+        }
+    }
+
+    static int binary_search(int arr[], int target) {
+
+        int leftIndex = 0;
+        int rightIndex = arr.length - 1;
+
+        while (leftIndex <= rightIndex) {
+            int mid = (leftIndex + rightIndex) / 2;
+
+            if (arr[mid] == target) {
+                return mid;
+            } else if (arr[mid] > target) {
+                rightIndex = mid - 1;
+
+            } else {
+                leftIndex = mid + 1;
+
+            }
+        }
+        return -1;
+
+    }
+}