python3.5递归函数的应用-二分法查找数字

# Author Richard_Kong
# !/usr/bin/env python
# --*-- encoding:utf-8 --*--
"""
递归函数的应用：
利用二分法查找数字：
要先将列表排序
"""
data = [1,2,3,4,5,6,7,8,93,11,13,12,567,78,90,6778]
print(data)
print(data.sort())
print(data)

def binary_search(data_set,find_num):
    print(data_set)

    if len(data_set)>1:
        print()
        if data_set[int(len(data_set)/2)] == find_num:
            print("find the num",data_set[int(len(data_set)/2)])
        elif data_set[int(len(data_set)/2)] >find_num:
            print("fin_num 在左边")
            return binary_search(data_set[0:int(len(data_set)/2)],find_num)
        elif data_set[int(len(data_set)/2)] <find_num:
            print("find_num 在右边")
            return binary_search(data_set[int(len(data_set) / 2):], find_num)
    else:
        if data_set[0] == find_num:
            print("find the num",data_set[0])
        else:
            print("找不到数字，不再这个列表里")

binary_search(data,94)