1128-2019-算法-二分查找算法

package BinarySearch;

import org.junit.Test;

/**
 * @author pdzz
 * @create 2019-11-28 10:40
 */
public class BinarySearch {

    public int binarySearch(int[] nums, int target){
        //默认升序排列
        int left = 0;
        int right = nums.length;
        while (left <= right){
            int pivot = (left + right) >>> 1;
            if (nums[pivot] == target){
                return pivot;
            }
            if (target < nums[pivot]){
                right = pivot - 1;
            } else {
                left = pivot + 1;
            }
        }
        return -1;
    }


    @Test
    public void test1(){

        int[] arr = {1,2,3,4,5,6,7,8};
        System.out.println(binarySearch(arr, 8));


    }



}