摘要: /*binsearch函数:在v[0]<=v[1]<=v[2]<=...<=v[n-1]中查找x*/int binsearch(int x,int v[], int n){ int low, high, mid; low = 0; high = n-1; while(low <= high) { m 阅读全文
posted @ 2019-11-14 22:14 烟火流沙 阅读(118) 评论(0) 推荐(0) 编辑