c语言折半查找法

#include<stdio.h> int BinSearch(int arr[],int len,int key) { int low=0; //起始元素 int high=len-1; //终止元素 int mid; while(low<=high) { mid=(low+high)/2; if(arr[mid]==key) { return mid; }

>>阅读原文<<