golang实现二分查找

一组数据要进行二分查找，那么这个要查找的元素是有序，并且是连续存放（数组）。这样才可以进行二分查找。

package main 
import (
    "fmt"
)
func main(){
    var lookingFor int = 6
    var sortedArray []int = []int{1, 3, 4, 6, 7, 9, 10, 11, 13}
    index := binarySearch(sortedArray, lookingFor)
    fmt.Println("the array", sortedArray)
    fmt.Println("the lookingFor", lookingFor)
    if index >= 0 {
        fmt.Println("Find the index:", index)
    } else {
        fmt.Println("Not Find the Data!")
    }
}

func binarySearch(sortedArray []int, lookingFor int) int {
    var low int = 0
    var high int = len(sortedArray) - 1
    for low <= high {
        var mid int =low + (high - low)/2
        var midValue int = sortedArray[mid]
        if midValue == lookingFor {
            return mid
        } else if midValue > lookingFor {
            high = mid -1
        } else {
            low = mid + 1
        }
    }
    return -1
}