数据结构的题:选取任一种排序方法之后进行折半查找答:{//折半查找 int low=1,high=n,mid;while (low<=high){ mid=(low+high)/2;if (r[mid]==k) return mid;if (r[mid]>k)high=mid-1;else low=mid+1;} return 0;} void main(){ int a[]={11,21,5,12,23,1,34,211,66,2};int pos;BubbleSort(a);pos=binsearch(a,5);...