FilesExpand file tree

 master

/

binarySearch.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

41 lines (35 loc) · 1 KB

 master

/

binarySearch.py

Copy path

Top

File metadata and controls

• Code
• Blame

41 lines (35 loc) · 1 KB

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

39

40

41

# Linear Search

def linear_search(data, target):

for i in range(len(data)):

if data[i] == target:

return True

return False

# Iterative Binary Search

def binary_search_iterative(data, target):

low = 0

high = len(data) - 1

while low <= high:

mid = (low + high) // 2

if target == data[mid]:

return mid

elif target < data[mid]:

high = mid - 1

else:

low = mid + 1

return mid #return the location of found number

# Recursive Binary Search

def binary_search_recursive(data, target, low, high):

if low > high:

return False

else:

mid = (low + high) // 2

if target == data[mid]:

return mid #return the location of found number

elif target < data[mid]:

return binary_search_recursive(data, target, low, mid-1)

else:

return binary_search_recursive(data, target, mid+1, high)

data = [2,4,5,7,8,9,12,14,17,19,22,25,27,28,33,37]

target = 37

print(binary_search_recursive(data, target, 0, len(data)-1))

print(binary_search_iterative(data, target))