преобразование в график потока управления

int BSearch (List, Elem, LEN)
    int LEN, List [LEN], Elem;
{
    int high, low, mid;

    low = 1;
    high = LEN-1;
    mid = (low + high) / 2;
    while (Elem != List[mid])
    {
        mid = (low + high) / 2;
        if (high < low)
            return (FALSE);
        else if (Elem == List[mid])
            return (TRUE);
        else if (Elem > List[mid])
            low = mid + 1;
        else
            high = mid - 1;
    }
    return (TRUE);
}