折半查找的遞歸實現和非遞歸實現（c++）

#include<stdio.h> //折半查找 非遞歸實現 int BinSearch1(int r[],int n,int k) { int mid,low =1,high =n; while (low <=high) { mid =(low + high)/2; if(k<r[mid])high =mid-1; else if(k>r[mid])low =mid +1; else ret

>>阅读原文<<