1)递归方法实现：int BSearch(elemtype a[],elemtype x,int low,int high)/*在下届为low，上界为high的数组a中折半查找数据元素x*/{ int mid; if(low>high) return... [二分查找]