首页 > 编程语言 > 详细

python s12 day4 算法基础之二分查找

时间:2017-02-15 10:52:39      阅读:210      评论:0      收藏:0      [点我收藏+]

def binary_search(data_source,find_n):

  mind=int(len(data_source)/2)

  if len(data_source)>=1:

    if data_source[mid]>find_n:

      print("data in left of [%s]"%sdata_souerce[mid])

      //print(data_souerce[:mid]

        binary_search(data_source[:mid],find_n)  

  

    elif data_source[mid]<find_n:

      print("data in right of [%s]"%data_souerce[mid])

     //print(data_souerce[mid:]

        binary_search(data_source[mid:],find_n)  

    else:

       print("found find_s "data_souerce[mid])

         binary_search(data_source[mid:],find_n)  

  else:

    print("cannot find....")

if_name_==‘_main_‘:

  data=list(range(1,600,3)

  print(data)

  binary_search(data,39)

python s12 day4 算法基础之二分查找

原文:http://www.cnblogs.com/my334420/p/6400440.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!