TheAlgorithms · Shamim-Nik · Mar 12, 2020 · Mar 12, 2020
diff --git a/Searches/LowerBound.java b/Searches/LowerBound.java
@@ -0,0 +1,20 @@
+public class  LowerBound {
+
+    public static void LowerBound(String[] args) {
+    }
+
+    private static int lowerBound(int[] array, int length, int value) {
+        int low = 0;
+        int high = length;
+        while (low < high) {
+            final int mid = (low + high) / 2;
+            //checks if the value is less than middle element of the array
+            if (value <= array[mid]) {
+                high = mid;
+            } else {
+                low = mid + 1;
+            }
+        }
+        return low;
+    }
+}
diff --git a/Searches/UpperBound.java b/Searches/UpperBound.java
@@ -0,0 +1,19 @@
+public class UpperBound {
+    public static void UpperBound(String[] args) {
+
+    }
+
+    private static int upper_bound(int arr[], int value) {
+        int low = 0;
+        int high = arr.length;
+        while (low < high) {
+            int mid = (low + high) / 2;
+            if (value >= arr[mid]) {
+                low = mid + 1;
+            } else {
+                high = mid;
+            }
+        }
+        return low;
+    }
+}