FilesExpand file tree

 master

/

binary_search_algo.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

33 lines (25 loc) · 903 Bytes

 master

/

binary_search_algo.py

Copy path

Top

File metadata and controls

• Code
• Blame

33 lines (25 loc) · 903 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

# This is a binary search algorithm

# At : 23/6/1402(probably)

def binary_search(arr, item):

# Variables #

low = 0

high = len(arr) - 1

duration = 0

# Binary Searching

while low <= high:

duration += 1

mid = (low+high) // 2

# Checking differences between target value("item") and middle of array("mid")

if arr[mid] == item:

return f"\n||| I found {item} at the {mid} index of the array |||\n# Duration : {duration}"

elif arr[mid] > item:

high = mid - 1

print(f"its lower than {arr[mid]}!")

else:

low = mid + 1

print(f"its bigger than {arr[mid]}!")

# run the function

print("\n\n<-------------Binary Searching------------->\n")

numbers_array = range(1, 10000)

print(binary_search(numbers_array, 250))

print("\n<------------------Done------------------->\n")