Position BinarySearch( List L, ElementType X ){
int start=1,end=L->Last;
int mid;
while(start<=end){
mid=(start+end)/2;
if(L->Data[mid]==X){
return mid;
}else if(L->Data[mid]>X){
end=mid-1;
}else{
start=mid+1;
}
}
return NotFound;
}