折中查找法

输入一个数n，在已有的数组中寻找相应的元素

#include <stdio.h>
#include <string.h>
int main(){
    int shuzu[]={0,1,2,4,5,6,7,9};
    int daxiao= sizeof (shuzu)/sizeof(shuzu [0]);
    int zuo=0;
    int you=daxiao-1;
    int n;
    printf("输入你要查找的数字n:\n");
    scanf("%d",&n);
    while (zuo<=you)
    { int zhong=(zuo+you)/2;
        if (shuzu[zhong]>n)
        {
            you=zhong-1;
        }
        else if (shuzu[zhong]<n)
        {
            zuo=zhong+1;
        }
        else
        {printf("找到了，%d=数组[%d]",n,zhong); 
        break;}
    }
    if (zuo>you)
    {
        printf("妹找到");
    }
    
    return 0;
}