- To find the
first element bigger than or equal to target, or
last element smaller than or equal to target, use
<=, and we don’t need a last check on
- Don’t need
left + right >> 1because there won’t be infinite loops, and we won’t miss any ans.
Given an array of integers
nums which is sorted in ascending order, and an integer
target, write a function to search
target exists, then return its index. Otherwise, return
You must write an algorithm with
O(log n) runtime complexity.
Input: nums = [-1,0,3,5,9,12], target = 9