有序升序数组的二分查找//有序升序数组二分查找#include<stdio.h>#include<windows.h> //控制台显示int BinSearch(int arr[],int num, int x){ int left = 0; int right = num - 1; while (left<=right) //条件判定 { int mid = (left + right) / 2; //先与中间数字进行对比 if (x
摘要由CSDN通过智能技术生成
有序升序数组的二分查找
//有序升序数组二分查找#include<stdio.h>#include<windows.h>//控制台显示intBinSearch(int arr[],int num,int x){
int left =0;int right = num -1;while(left<=right)
有序升序数组的二分查找//有序升序数组二分查找#include<stdio.h>#include<windows.h> //控制台显示int BinSearch(int arr[],int num, int x){ int left = 0; int right = num - 1; while (left<=right) //条件判定 { int mid = (left + right) / 2; //先与中间数字进行对比 if (x