二分查找
public class BinarySearch {
public static int binarySearch(int searchNum, int[] arr, int left, int right) {
while (left <= right) {
int mid = left + (right - left) / 2;
if (arr[mid] == searchNum) {
return mid;
} else if (searchNum < arr[mid]) {
right = mid - 1;
} else {
left = mid + 1;
}
}
return -1;
}
}