FilesExpand file tree

 master

/

binary_search.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

24 lines (18 loc) · 607 Bytes

 master

/

binary_search.py

Copy path

Top

File metadata and controls

• Code
• Blame

24 lines (18 loc) · 607 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

#!/usr/bin/env python

import random

rand_num_li = sorted([random.randint(1, 50) for _ in range(10)])

target = random.randint(1, 50)

def binary_search(arr, lb, ub, target):

if lb <= ub:

mid = ub + lb // 2

if arr[mid] == target:

return mid

elif arr[mid] < target:

return binary_search(arr, mid + 1, ub, target)

else:

return binary_search(arr, lb, mid - 1, target)

else:

return -1

print("List: {}\nTarget: {}\nIndex: {}".format(

rand_num_li, target,

binary_search(rand_num_li, 0, len(rand_num_li) - 1, target)))