用Java写一个二分查找

二分查找是一种在有序数列中查找特定元素的算法。下面是用Java实现二分查找的代码示例：

public static int binarySearch(int[] array, int target) {
    int left = 0;
    int right = array.length - 1;
    while (left <= right) {
        int middle = (left + right) / 2;
        if (array[middle] == target) {
            return middle;