Skip to content

fix: improve binary search mid calculation to avoid overflow #1891

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
satish-sharma360 wants to merge 1 commit into
base: master
Choose a base branch
from
+2 −1
Open

fix: improve binary search mid calculation to avoid overflow #1891

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion Search/BinarySearch.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,8 @@
*/

function binarySearchRecursive(arr, x, low = 0, high = arr.length - 1) {
const mid = Math.floor(low + (high - low) / 2)
// Using optimized mid calculation to prevent overflow
const mid = low + Math.floor((high - low) / 2);

if (high >= low) {
if (arr[mid] === x) {
Expand Down
Loading