def binSearch(wheel, num):
    """Standard binary search
    Args:
        wheel(list): An ordered list of floats/ints
        num(int/float): Element to be searched
    
    Returns:
        int: value
    """
    mid = len(wheel)//2
    low, high, answer = wheel[mid]
    if low<=num<=high:
        return answer
    elif high < num:
        return binSearch(wheel[mid+1:], num)
    else:
        return binSearch(wheel[:mid], num)