云算法 二分查找 额外的课程

def find(array, k): 
    k = int(k)
    length = len(array)
    print("array's:" + str(length))
    for index in range(length):
        # 数组 遍历
        print('index:' + str(index) + 'current_value:' + str(array[index]) )
        if array[index] == k:
            return True
    return False 
array = [1,2,3,4,5,6,7,8,9]
k = input('input k value: ')
print(find(array,k))

大师建议：把python基础再看一遍 

def  binary_search(array, k):
    k = int(k)
    length = len(array)
    left = 0
    right = length - 1
    while  left <= right :
        mid = int((left + right)/2)
        current_num = array[mid]
        if current_num == k 
            return True
        elif current_num < k :
            left = mid + 1
        elif current_num > k :
            right = mid - 1
    return False 
array = [1,2,3,4,5,6,7,8,9]
k=input ('find:')
print(binary_search(array, k))