二分查找

20210109/main.go

@@ -5,11 +5,15 @@ func main() {
 }
 
 func search(n int, nums []int) int {
-	l := len(nums)
+	low, high := 0, len(nums)-1
-	c := l / 2
+	for low <= high {
-	for {
+		mid := low + (high-low)/2
-		if c == 0 {
+		if nums[mid] == n {
-
+			return mid
+		} else if n < nums[mid] {
+			high = mid - 1
+		} else if n > nums[mid] {
+			low = mid + 1
 		}
 	}
 	return -1