#include<stdio.h> int binarySearch(int arr[], int low, int high, int x) { if (high >= low) { int mid = (low + high)/2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, low, mid-1, x);
return用C++写一个二分查找的代码
猜你喜欢
转载自blog.csdn.net/weixin_35756690/article/details/129497686
今日推荐
周排行