python用二分法查找元素位置_Python-二分法查找

#!/usr/bin/env python

#_*_ coding:utf-8 _*_

#encoding=utf-8

#function:实现二分法查找的方法

#created by xkq

#date: 2018

def BinarySearch_1(data_source,find):#方法一

mid = int(len(data_source) / 2)

if len(data_source)>1:

if data_source[mid]>find:

#print(data_source[:mid])

#print("on the left of %s"%data_source[mid])

BinarySearch_1(data_source[:mid],find)

elif data_source[mid]

#print(data_source[mid:])

#print("on the right of %s" % data_source[mid])

BinarySearch_1(data_source[mid:], find)

else:

print("find:%s"%data_source[mid])

elif len(data_source)==1:

if data_source[mid]==find:

print("find:%s" % data_source[mid])

else:

print("no find")

def BinarySearch(data_source,find):#方法二