Question

数据结构（填空）基于有序顺序表的折半搜索递归算法（Element为有序顺序表）

4、基于有序顺序表的折半搜索递归算法（Element为有序顺序表）
template <class Type> int orderedList<Type> ::
BinarySearch(const Type & x, const int low, const int high)const
{
int mid = -1;
if ( low <= high ) {

__________________________;
if ( Element[mid].getKey( ) < x )

mid = BinarySearch (__________________________);
else if ( Element[mid].getKey( ) > x )
mid = BinarySearch ( x, low, mid -1 );
}
return mid;
}

Answer 1

http://www.docin.com/p-733246471.html