Exercise 1.8 Binary Search - Function Problems

Problem-solving Code

Position BinarySearch( List L, ElementType X )
{
    Position left=0,right=L->Last;
    Position loc,ret=NotFound;
    while(left<=right){
        loc=(left+right)/2;
        if(L->Data[loc]==X){
            ret=loc;
            break;
        }else if(L->Data[loc]>X){
            right=loc-1;
        }else{
            left=loc+1;
        }
    }
    return ret;
}

Test Results

Finishing problem