前提是数组是按照关键字递增方式排序的

    1. func binarySearch(nums []int, findValue int) int {
    2.     left := 0
    3.     right := len(nums) - 1
    4.     for left <= right {
    5.         mid := left + (right-left)/2
    6.         if nums[mid] == findValue {
    7.             return mid
    8.         }
    9.         if nums[mid] > findValue {
    10.             right = mid - 1
    11.         } else {
    12.             left = mid + 1
    13.         }
    14.     }
    15.     return -1
    16. }