Merge pull request #65 from lucky29-git/main

Searching Algo added pls accept PR .

Author: codemuscles

java/Searching/BinarySearch.java

@@ -0,0 +1,28 @@
+package GitCowls;
+
+public class BinarySearch {
+    public static void main(String[] args) {
+        int[] arr ={-22, -13, -6, -3, 2, 4 ,10, 14, 28, 31, 45};
+        int target =28;
+        int ans = BinarySearchCode(arr,target);
+        System.out.println(ans);
+
+    }
+    static int BinarySearchCode(int[] arr , int target){
+        int start =0;
+        int end = arr.length - 1 ;
+
+        while (start <= end){
+            int mid = start + (end-start)/2;
+
+            if(target< arr[mid]){
+                end = mid-1;
+            } else if (target > arr[mid]) {
+                start = mid+1;
+            }else{
+                return mid;
+            }
+        }
+        return -1;
+    }
+}

java/Searching/LinearSearch.java

@@ -0,0 +1,26 @@
+package GitCowls;
+
+public class LinearSearch {
+    public static void main(String[] args) {
+    int[] arr = {14, 11, 23, 45, 76, 5, 6, 89, 76, -11};             // For eg.
+    int target = 76;
+    int ans = LinearSearchFn(arr, target);
+        System.out.println(ans);
+
+    }
+
+    static int LinearSearchFn(int[] arr, int target) {
+        if (arr.length == 0) {
+            return -1;                                            // if item not found --> return -1
+        }
+
+        for (int index = 0; index < arr.length; index++) {
+            int element = arr[index];
+            if (element == target) {
+                return index;
+            }
+        }
+
+        return -1;
+    }
+}