折半查找算法

#include <stdio.h>void fun(int *a, int left, int right, int value);int main(void){    int a[10] = {        13, 14, 15, 20, 28, 40, 44, 70, 92, 95    };    int num;    printf("请输入您要查找的数：");    scanf("%d", &num);      fun(a, 0, 9, num);    return 0;} void fun(int *a, int left, int right, int value){    int p = (left + right) / 2;    if(value == a[p])    {        printf("您要查找的数在数组的%d位置\n", p);    }    else if(value > a[p])    {        left = p;        fun(a, left, right, value);    }    else    {        right = p;        fun(a, left, right, value);    }}