(經典) K&R的名著<<C程式設計語言>>二分尋找

標籤：search   演算法   log   名著   int   遞迴   二分   程式設計   程式   

#include<stdio.h>//尋找成功則返回所在下標否則返回-1int binsearch(int A[], int n,int a){   int low, high, mid;   low = 0;   high = n -1;   while ( low <= high) {    /// 這裡必須是 <=        mid = (low+high) / 2;        if (A[mid] == a)           return mid;        else if(A[mid]<a)           low = mid +1;        else           high=mid-1;    }   return -1;}int main(){   int a[]={1,2,44,44,99};    printf("%d",binsearch(a,5,44));}

//二分尋找,遞迴演算法#include <iostream>#include<stdio.h>using namespace std;int binSearch(int a[],int low,int high,int b){    int mid = (high-low)/2;    if(a[mid] == b) return mid;    if(a[mid] > b)  binSearch(a,low,mid-1,b);    if(a[mid] < b)  binSearch(a,mid+1,high,b);}int main(){   int a[] = {2,6,8,88888,88888888}; int yy;    yy = binSearch(a,0,4,8);    printf("%d",yy);    return 0;}

 

(經典) K&R的名著<<C程式設計語言>>二分尋找