java binary search no recursion

package com.gxmedu.binary_sort_no_recursion;

/**
 * @author 郭学明
 * @version 1.0
 * 默认升序
 */
public class BinarySortNoRecursion {
    public static void main(String[] args) {
        int[] arr = {1,45,67,123,887,1234};
        int index = binarySort(arr, 1234);
        System.out.println(index);

    }
    public static int binarySort(int[] arr, int target){
        int left = 0;
        int right = arr.length - 1;

        while(left <= right){
            int mid = (left + right) / 2;
            if(arr[mid] == target ){
                return mid;
            }else if(target < arr[mid]){
                right = mid - 1;
            }else{
                left = mid + 1;
            }
        }
        return -1;
    }
}