二分查找

#include<stdio.h>
void printarry(int a[], int length);
void erfenchazhao(int a[], int e,int length);
void printarry(int a[], int length) {
    printf("有序数组为的数:");
    for (int i = 0; i < length - 1; i++)
    {
        printf("%d\t", a[i]);
    }
    printf("\n");
}
void erfenchazhao(int a[], int e, int length) {
    int mid, right, left;
    int flag;
    right = 0;
    left = length - 1;
    mid = (right + left) / 2;
    flag = 1;
    while (flag) {
        if (right <= left) {
            if (a[mid] < e)
            {
                right = mid + 1;
                mid = (right + left) / 2;
            }
            else if (a[mid] > e) {
                left = mid - 1;
                mid = (right + left) / 2;
            }
            if (a[mid] == e)
            {
                flag = 0;
                printf("找到了");
            }
        }
        else {
            printf("没找到");
            flag = 0;
        }
    }
}
int main(void) {
    int arry[] = { 15,35,40,50,60,85,90 };
    int length = 7;
    int chazhao;
    printarry(arry, length);
    printf("请输入要查找的数:");
    scanf_s("%d", &chazhao);
    fflush(stdin);
    erfenchazhao(arry, chazhao, length);
    return 0;
}