private arr: number[] = new Array(10);
private erfen(arr: number[], x: number): number {
//速度是 o(log n) 默认是2为底
//前提 已排好顺序
//返回 indx
let left: number = 0;
let right: number = arr.length - 1;
while (left <= right) {
let middle: number = Math.ceil((left + right) / 2);
if (x == arr[middle]) {
return middle;
}
if (x > arr[middle]) {
left = middle + 1;
} else {
right = middle - 1;
}
}
return -1
}