java顺序查找

package Array;

public class ArrayTwoFindDemo01 {
    public static void main(String[] args) {
        //  0 1 2 3 4 5 6 7 8 9 10
        int[]arr = {2,5,7,8,10,15,18,20,25,28};//数组是有序的
        int value = 18;
        //顺序查找 最多查找 n-
        //二分查找 最多查找n/2  大大降低了执行的时间 效率提升了
        int index = -1;
        int left = 0;
        int right = arr.length-1;
        int mid = (right+left)/2;
        while (left <= right){
            System.out.println("范围是："+left+"-->"+right);
            System.out.println("mid是："+mid);
            if (arr[mid] ==value){
                index = mid;
                break;
            }else if (arr[mid]<value){
                left=mid +1;
            }else {
                right=mid-1;
            }
            mid = (right + left)/2;
        }
        if (index == -1){
            System.out.println("你查找的数据不存在");
        }else {
            System.out.println(value+"在数组1中的索引是："+index);
        }
    }
}