有序数组搜索二分法

int BinarySearch(int s[] ,int len ,int num) { int t1 = 0,t2 = 0; if (len < 0) return -1; t1 = len >> 2; while(t1 >= 0) { if(s[t1] < num) t1 = t1 + ((len -t1) /2 ); else if (s[t1] > num) t1 = t1 >> 2; else return t1; } };