FilesExpand file tree

 master

/

binary_search.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

38 lines (35 loc) · 826 Bytes

 master

/

binary_search.py

Copy path

Top

File metadata and controls

• Code
• Blame

38 lines (35 loc) · 826 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

#coding:utf-8

from random import randint

from bisect import *

def binary_search(lst,value,low,high):

if low > high:

return -1

mid = (low + high) / 2

if value == lst[mid]:

return mid

elif value < lst[mid]:

return binary_search(lst,value,low,mid - 1)

else:

return binary_search(lst,value,mid + 1,high)

def binary_search1(lst,value):

low,high = 0,len(lst) - 1

while low <= high:

mid = (low + high) / 2

if lst[mid] == value:

return mid

elif lst[mid] < value:

low = mid + 1

else:

high = mid - 1

return -1

def binary_search2(lst,value):

i = bisect_left(lst,value)

if i != len(lst) and lst[i] == value:

return i

return -1

if __name__ == "__main__":

lst = [randint(0,100) for i in range(10)]

lst.sort()

print lst

# print binary_search(lst,80,0,len(lst) - 1)

print binary_search2(lst,80)