折半查找和顺序查找

一：折半查找（二分查找）只适用于有序序列

while(low<=high)
{
    mid=(low+high)/2;
    if(m<a[mid])
        high=mid-1;
    else
        if(m>a[mid])
        low=mid+1;
        else
        {
            k=mid;
            break;
        }
}

二：顺序查找

for(i=0;i<N;i++)
    if(m==a[i])
    {
    k=i;
    break;
    }
if(k>=0)
    printf("m=%d,index=%d\n",m,k);
else
    printf("NO");