public static boolean binarySearch(int x) {
int left = 0;
int right = arrM.length- 1;
while (left <= right) {
int mid = (left + right) / 2;
int midValue = arrM[mid];
if (x > midValue) {
left = mid + 1;
} else if (x < midValue) {
right = mid - 1;
} else {
return true;
}
}
return false;
}