add another solution of Binary Search

Author: za-bannai

go/binary_search.go

@@ -1,6 +1,8 @@
 //lint:file-ignore U1000 Ignore all unused code
 package main
 
+import "sort"
+
 func binarySearchHalfClosed(nums []int, target int) int {
 	left, right := 0, len(nums)
 	for left < right {
@@ -32,3 +34,13 @@ func binarySearchClosed(nums []int, target int) int {
 	}
 	return -1
 }
+
+func search(nums []int, target int) int {
+	index := sort.Search(len(nums), func(i int) bool {
+		return nums[i] >= target
+	})
+	if index < len(nums) && nums[index] == target {
+		return index
+	}
+	return -1
+}