查找

#include<stdio.h>#include<stdlib.h>typedef struct List{    int data;}Pelist;#define n  8typedef Pelist TypeKey[n+1];//顺序查找int seeksort(TypeKey R,int data){    int i;    R[0].data = data;    for(i=n;i>=0;i--)    {        if(R[i].data==data)            return i;    }}//折中查找int midsort(TypeKey R,int key){    int mid,low,high;    low = 1;    high = n;    printf("the n is %d\n",high);    while(low<=high)    {        mid = (low+high)/2;        printf("the mid is %d\n",mid);        if(R[mid].data == key)        {            return mid;        }        if(R[mid].data>key)            high = mid-1;        else                low = mid+1;    }    return 0;}int main(int argc, char const *argv[]){    int result;    TypeKey R = {0,12,13,14,15,16,17,18,19};    result = midsort(R,16);    printf("the result is %d\n", result);    return 0;}