From 734fcf0732d3f47ff171030cf44f67215c8d6caa Mon Sep 17 00:00:00 2001 From: Amal Bijoy Date: Tue, 7 Apr 2026 11:41:02 +0530 Subject: [PATCH] Use overflow-safe midpoint in binary search --- Searching-algorithms/Binarysearch.java | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) 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])