FilesExpand file tree

 master

/

BinarySearch.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

20 lines (18 loc) · 478 Bytes

 master

/

BinarySearch.py

Copy path

Top

File metadata and controls

• Code
• Blame

20 lines (18 loc) · 478 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

# 实现一个二分查找

# 输入:一个顺序list

# 输出: 待查找的元素的位置

def binarySearch(alist, item):

first = 0

last = len(alist) - 1

while first <= last:

mid = (first + last)//2

print(mid)

if alist[mid] > item:

last = mid - 1

elif alist[mid] < item:

first = mid + 1

else:

return mid+1

return -1

test = [0, 1, 2, 8, 13, 17, 19, 32, 42]

print(binarySearch(test, 3))