C语言二分查找（折半查找）算法及代码

复制纯文本新窗口

1. #include <stdio.h>
2.  
3. binarySearch(int a[], int n, int key){
4. int low = 0;
5. int high = n - 1;
6. while(low<= high){
7. int mid = (low + high)/2;
8. int midVal = a[mid];
9. if(midVal<key)
10. low = mid + 1;
11. else if(midVal>key)
12. high = mid - 1;
13. else
14. return mid;
15. }
16. return -1;
17. }
18.  
19. int main(){
20. int i, val, ret;
21. int a[8]={-32, 12, 16, 24, 36, 45, 59, 98};
22. for(i=0; i<8; i++)
23. printf("%d\t", a[i]);
24.  
25. printf("\n请输人所要查找的元素：");
26. scanf("%d",&val);
27.  
28. ret = binarySearch(a,8,val);
29.  
30. if(-1 == ret)
31. printf("查找失败 \n");
32. else
33. printf ("查找成功 \n");
34.  
35. return 0;
36. }

#include <stdio.h>

binarySearch(int a[], int n, int key){
    int low = 0;
    int high = n - 1;
    while(low<= high){
        int mid = (low + high)/2;
        int midVal = a[mid];
        if(midVal<key)
            low = mid + 1;
        else if(midVal>key)
            high = mid - 1;
        else
            return mid;
    }
    return -1;
}

int main(){
    int i, val, ret;
    int a[8]={-32, 12, 16, 24, 36, 45, 59, 98};
    for(i=0; i<8; i++)
        printf("%d\t", a[i]);

    printf("\n请输人所要查找的元素：");
    scanf("%d",&val);

    ret = binarySearch(a,8,val);

    if(-1 == ret)
        printf("查找失败 \n");
    else
        printf ("查找成功 \n");

    return 0;
}