C语言二分查找算法函数

Question

C语言二分查找算法函数遇到问题

#include<stdlib.h>
#include<stdio.h>
#include<string.h>
void binarysear(int arr[],int a,int sz)
{
    int right=sz-1;
    int left=0;
    int mid=left+(right-left)/2;
     for(;left<=right;)
    {
        if(arr[mid]>a)
        right=mid-1;
        else if(arr[mid]<a)
        left=mid+1;
        else
        {
        printf("找到的目标，其下标为%d",mid);
        break;
        }
    }
    if(left>right)
    printf("未找到目标");
}
int main()
{
   int arr[]={1,2,3,4,5,6,7,8,9,10};
   int sz=sizeof(arr)/sizeof(arr[0]);
   
   binarysear(arr,2,sz);
    system("pause");
    return 0;
}

没有输出结果

Answer 1

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

void binarySearch(int arr[], int target, int sz) {
    int right = sz - 1;
    int left = 0;
    int mid;

    while (left <= right) {
        mid = left + (right - left) / 2;
        if (arr[mid] == target) {
            printf("找到的目标，其下标为%d", mid);
            return;
        } else if (arr[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    
    printf("未找到目标");
}

int main() {
    int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    int sz = sizeof(arr) / sizeof(arr[0]);

    binarySearch(arr, 2, sz);

    system("pause");
    return 0;
}