二分查找算法

想写好二分查找算法还真是不容易阿！～涉及到以前很多没考虑到的小细节～～

但总的来说left 和 right的开闭区间总是要保持一致：

 

1  先看左右闭区间的：

int bSearch(int array[], int n, int v) { int left, right, middle; left = 0, right = n - 1; while (left <= right) { middle = (left + right) / 2; if (array[middle] > v) { right = middle - 1; } else if (array[middle] < v) { left = middle + 1; } else { return middle; } } return -1; } 

 

2 在看双开的：

int bSearch(int array[],int n,int v) { int left,right,middle; left = -1, right = n; while((left + 1) != right) { middle = left + (right - left)/2; if(array[middle] < v) left = middle; else right = middle; } if(right >= n || array[right]!= v) right = -1; return right; }

 

3 左关右开的：

int bSearch(int array[], int n, int v) { int left, right, middle; left = 0, right = n; while (left < right) { middle = (left + right) / 2; if (array[middle] > v) { right = middle; } else if (array[middle] < v) { left = middle + 1; } else { return middle; } } return -1; } 

 

4再看一个任意类型的：

void* bSearch_1(const void *base,const void *key,size_t n,size_t size,int(*compar)(const void*,const void*)) { size_t left,right,middle; const void *p; int ret; left = -1,right = n; while(left < right) { middle = left + (right - left)/2; p = (void*)(((char*)base) + (middle*size)); ret = (*compar)(key,p); if(ret < 0) { right = middle; } else if(ret > 0) { left = middle; } else return (void*)p; } return NULL; }