algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-24 04:54:21 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: include IM_AVERAGE_COMPUTATION_COULD_OVERFLOW (#5131)

Browse Source
This commit is contained in:
Piotr Idzik
2024-05-01 11:58:04 +02:00
committed by GitHub
parent b075c19a54
commit 2513ccd62b
5 changed files with 6 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/main/java/com/thealgorithms/misc/RangeInSortedArray.java
View File

@ -26,7 +26,7 @@ public class RangeInSortedArray {
if (left > right) {
return;
}
int mid = (left + right) / 2;
int mid = (left + right) >>> 1;
if (nums[mid] > key) {
alteredBinSearch(nums, key, left, mid - 1, range, goLeft);
} else if (nums[mid] < key) {
@ -52,7 +52,7 @@ public class RangeInSortedArray {
// of 'key'
public static void alteredBinSearchIter(int[] nums, int key, int left, int right, int[] range, boolean goLeft) {
while (left <= right) {
int mid = (left + right) / 2;
final int mid = (left + right) >>> 1;
if (nums[mid] > key) {
right = mid - 1;
} else if (nums[mid] < key) {
@ -84,7 +84,7 @@ public class RangeInSortedArray {
public static int getLessThan(int[] nums, int key, int left, int right) {
int count = 0;
while (left <= right) {
int mid = (left + right) / 2;
final int mid = (left + right) >>> 1;
if (nums[mid] > key) {
right = mid - 1;
} else if (nums[mid] <= key) {