INT binarysearch (int key)
{
INT left; // Left var
Int Right; // Right Var
Int middle;
LEFT = 0;
Right = max-1; // max is the number of array members
While (Left <= Right)
{
Middle = (Left Right) / 2;
Key
Right = middle -1;
Else IF (key> data [middle])
Left = middle 1;
Else IF (key == data [middle])
Printf ("Find It! Data [% D] / N", Middle)
Return 1; // 1 means succes
}
}
