python递归--通过栈找到数据

def twoSplit(sourceData,findData):
    sp=int(len(sourceData)/2)
    if sourceData[0]==findData:
        print('找到数据',sourceData[0])
    else:
        if findData in sourceData[0:sp]:
            print('数据在左边[%s]'%sourceData[0:sp])
            twoSplit(sourceData[0:sp],findData)
        elif findData in sourceData[sp:]:
            print('数据在左边[%s]'%sourceData[sp:])
            twoSplit(sourceData[sp:],findData)
        else:
            print('找不到数据')


data = [1,2,'c',3,4,5,6,7,8,17,26,15,14,13,12,11,'a','b']
twoSplit(data,3)