[Grind 169] 8. Binary Search

#go #leetcode #grind169

Problem Link: https://leetcode.com/problems/binary-search/

Solution:

func search(nums []int, target int) int {

    var l, r = 0, len(nums)-1

    for l <= r {

        var mid = (l + r) / 2

        if nums[mid] == target {
            return mid
        }

        if target > nums[mid] {
           l = mid + 1
        } else {
           r = mid - 1
        }
    }

    return -1
}