java数组实现二分法查找

public class ArrayBinarySearch {

    public static void main(String[] args) {

        int arr[] = {10, 20, 30, 40, 50};
        int head = 0;
        int foot = arr.length - 1;
        int middle = (head + foot) / 2;
        int target = 50;
        int location = -1;
		while (true) {

            if (arr[middle] == target) {
                location = middle;
                break;
            } else if (target > arr[middle]) {
                head = middle + 1;
                middle = (head + foot) / 2;
            } else {
                foot = middle - 1;
                middle = (head + foot) / 2;
            }
        }
        System.out.println(location);

    }
}