python之路(七)-递归算法

def find(args1,args2):
    coun = len(args1)
    mid = int(coun/2)
    if coun >=  1:
        if args1[mid] > args2:
            find(args1[:mid],args2)

        elif args1[mid] < args2:
            find(args1[mid:],args2)
        else:
            print(‘找到了！‘)
    else:

        print(‘没找到‘)
primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
find(primes,71)