摘要: int find(int n,int a[],int l){int low=0;int high=l-1;int middle=0;while(low<high){middle=(low+high)>>1;if(n==a[middle]){printf("%d,%d",n,middle);retur 阅读全文
posted @ 2016-06-13 09:50 ocean2015 阅读(22350) 评论(1) 推荐(1) 编辑