rzdd1
7/21/2019 - 2:11 PM
Method to find a number inside a sorted list of numbers and return it's index. Faster than comparing.
Method to find a number inside a sorted list of numbers and return it's index. Faster than comparing.
public int binarySearch(int number, int[] listOfNumbers){
int upper = listOfNumbers.length - 1;
int lower = 0;
int medium = (lower + upper + 1) / 2;
int index = - 1;
do {
if (number == listNumbers[medium]) index = medium;
else if (number > listNumbers[medium]) lower = medium + 1;
else if (number < listNumbers[medium]) upper = medium - 1;
medium = (upper + lower + 1) / 2;
}while ((lower <= upper) && (index == - 1));
return index;
}