diff --git a/Searching-algorithms/Binarysearch.java b/Searching-algorithms/Binarysearch.java
index 81a2d16..5bed23d 100644
--- a/Searching-algorithms/Binarysearch.java
+++ b/Searching-algorithms/Binarysearch.java
@@ -52,7 +52,8 @@ public static int binarysearch(int[] arr, int key) {
         int low = 0; 
         int high = arr.length - 1;
         while (low <= high) {
-            int mid = (low + high) / 2;
+            // Safer midpoint formula avoids integer overflow when low + high exceeds int range.
+            int mid = low + (high - low) / 2;
             if (arr[mid] == key)
                 return mid;
             else if (key < arr[mid])