二分法

二分法的模版需要牢牢记：二分法是利用的decrease and conquer is different with divide and conquer
在有序的数组中寻找一个跟target value有关的index或value
比如：

• less than target 的最大index
• is greater equal than target 的最小minimum index（value）

总之 sorted数组与target related to index （value）

447 Search in a Big Sorted Array

because it is supper big array so it isn't possible to search in that array,we need think to decrease it "binary search " and then where is the "end"
the end can use the “倍增法Exponential Backoff”

标签：index,复习,value,二分法,decrease,array,target
来源： https://www.cnblogs.com/ldphoebe/p/16428855.html