scratch @ 753ee96

···
        
        1
        +package algos

      
        
        2
        +

      
        
        3
        +func BinarySearch(arr []int, target int) int {

      
        
        4
        +	lo, hi := 0, len(arr)-1

      
        
        5
        +	for lo <= hi {

      
        
        6
        +		mid := lo + (hi-lo)/2

      
        
        7
        +		if arr[mid] == target {

      
        
        8
        +			return mid

      
        
        9
        +		} else if arr[mid] < target {

      
        
        10
        +			lo = mid + 1

      
        
        11
        +		} else {

      
        
        12
        +			hi = mid - 1

      
        
        13
        +		}

      
        
        14
        +	}

      
        
        15
        +	return -1

      
        
        16
        +}

      

···
        
        1
        +package algos

      
        
        2
        +

      
        
        3
        +import "testing"

      
        
        4
        +

      
        
        5
        +func TestBinarySearch(t *testing.T) {

      
        
        6
        +	inp := []int{2, 3, 5, 6, 8, 10}

      
        
        7
        +

      
        
        8
        +	is(t, BinarySearch(inp, 420), -1)

      
        
        9
        +	is(t, BinarySearch(inp, 6), 3)

      
        
        10
        +}