Binary Search (二分搜索)

Posted on Edited on In Views:

算法原理

算法实现

1
2
3
4
5
6
7
public int binarySearch(T[] arr, T targ){
    int left=0, right=arr.length-1;
    while(left <= right){
        int mid = left + (right - left) >> 1;
        
    }
}

例子