查找一：C++静态查找

#include<iostream>
using namespace std;
#define MAXSIZE 100

int Seq_Search(int *a, int n, int key)
{
    int i;
    for(i=0; i<n;i++)
    {
        if(a[i]==key)
            return i; 
    }
    return 0;
}

//折半查找
int In_Search(int *a, int n, int key)
{
    int low, high, mid;
    low = 0; 
    high = n-1;
    while(low<high)
    {
        mid = (low+high)/2;
        if(a[mid]>key)
        {
            high--;
        }
        else if(a[mid]<key)
        {
            low++;
        }
        else
            return mid;
    }
    return 0;
}

//插值查找
int Insert_Search(int *a, int n, int key)
{
    int low, high, mid;
    low = 0; 
    high = n-1;
    while(low<high)
    {
        //插值
        mid = low + (high-low)*(key-a[low])/(a[high]-a[low]); 
        if(a[mid]>key)
        {
            high--;
        }
        else if(a[mid]<key)
        {
            low++;
        }
        else
            return mid;
    }
    return 0;
}

//斐波那契数列
void  Fibonacci(int *F)
{
    F[0] = 0;
    F[1] = 1;
    for(int i=2;i<MAXSIZE;i++)
    {
        F[i] = F[i-1] + F[i-2];
    }
}

//斐波那契查找
int Fibonacci_Search(int *a, int n, int key)
{
    int low = 0;
    int high = n-1;
    int mid;
    int F[MAXSIZE];
    Fibonacci(F);
    int k =0;
    while(n>F[k]-1)
        k++;
    int *temp = new int[F[k]-1];
    memcpy(temp,a,n*sizeof(int));
    for(int i=n;i<F[k]-1;i++)
        temp[i] = a[n-1];

    while(low<high)
    {
        mid = low + F[k-1] - 1;
        if(key<temp[mid])
        {
            high = mid-11;
            k = k-1;
        }
        else if(key>temp[mid])
        {
            low = mid+1;
            k = k-2;
        }
        else
        {
            if(mid<n)
                return mid;
            else
                return n-1;
        }
    }
    delete[] temp;
    return -1;
}

int main()
{
    int a[MAXSIZE];
    for(int i=0;i<MAXSIZE;i++)
        a[i] = i+1;
    cout << Seq_Search(a,MAXSIZE,45)<<endl;
    cout << In_Search(a,MAXSIZE,45)<<endl;
    cout << Insert_Search(a,MAXSIZE,45)<<endl;

    int arr[] = {0,16,24,35,47,59,62,73,88,99};  
    int key=73; 
    int index=Fibonacci_Search(arr,sizeof(arr)/sizeof(int),key);  
    cout<<key<<" is located at: "<<index;  

    system("PAUSE");  
    return 0;  
}