1. func BinarySearch(arr []int, leftIndex, rightIndex, findVal int) {
    2.     if leftIndex > rightIndex {
    3.         fmt.Println("没有找到")
    4.     }
    6.     for leftIndex != rightIndex {
    7.         middle := (leftIndex + rightIndex) / 2
    9.         if arr[middle] == findVal {
    10.             fmt.Println(middle)
    11.             break
    12.         } else if findVal > arr[middle] {
    13.             leftIndex = middle + 1
    14.         } else if findVal < arr[middle] {
    15.             rightIndex = middle - 1
    16.         }
    17.     }
    18. }
    20. func TestBinarySearch(t *testing.T) {
    21.     arr := []int{1, 2, 3, 5, 7, 15, 25, 30, 36, 39, 51, 67, 78, 80, 82, 85, 91, 92, 97}
    22.     BinarySearch(arr, 0, len(arr), 30)
    23. }