def bubble(aList):
    for i in range(len(aList)):
        for j in range(len(aList)-i-1):
            if aList[j]>aList[j+1]:
                temp = aList[j]
                aList[j]=aList[j+1]
                aList[j+1] = temp
        print(i)
        print(aList)
    return aList

def binsearch(aList,n):
    left = 0
    right = len(aList) - 1
    found = False
    while left <= right and not found:
        mid = (left + right)//2
        print(mid)
        if aList[mid] == n :
            found = True
        else :
            if n < aList[mid]:
                right = mid - 1
            else:
                left = mid + 1
    return found