Simplest example of Binary Search in java

BinarySearchClass.java

package dorid;

public class BinarySearchClass {
	private static int[] numAarray;
	private static final int numberToSearch = 89;

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		// array must be sorted

		numAarray = new int[] { 2, 5, 9, 34, 45, 67, 78, 89, 90 };
		int result = BinarySearch(numAarray, 89);
		if (result == -1) {
			System.out.println("number not found");
		} else {
			System.out.println("Number is at the index " + result);
		}

	}

	private static int BinarySearch(int[] searchArray, int searchNumeber) {

		int start, end, mid;
		start = 0;
		end = searchArray.length;
		while (start <= end) {
			mid = (start + end) / 2;
			if (searchArray[mid] == searchNumeber) {
				return mid;
			} else if (searchNumeber < numAarray[mid]) {
				end = mid - 1;

			} else {
				start = mid + 1;
			}
		}
		return -1;
	}

}