/Python/Implement a binary search of a sorted array of integers Using pseudo-code.

Implement a binary search of a sorted array of integers Using pseudo-code.

Iterative binary search python

def binary_search(a, key):
	low = 0
	high = len(a) - 1
	while low < high:
		mid = (low + high) // 2
		if key == a[mid]:
			return True
		elif key < mid:
			high = mid - 1
		else:
			low = mid + 1

	return False

Implement a binary search of a sorted array of integers Using pseudo-code.

# Here's the pseudocode for binary search, modified for searching in an array. The inputs are the array, which we call array; the number n of elements in array; and target, the number being searched for. The output is the index in array of target:

    1.Let min = 0 and max = n-1.
    2. Compute guess as the average of max and min, rounded down (so that it is an integer).
    3. If array[guess] equals target, then stop. You found it! Return guess.
    4. If the guess was too low, that is, array[guess] < target, then set min = guess + 1.
    5. Otherwise, the guess was too high. Set max = guess - 1.
    6. Go back to step 2.

Similar codes

1 vote232 views1 answer
Mean Kurtosis of all rows pandas
Python
15 votes246 views2 answers
Ansi colors
Python
7 votes258 views4 answers
How to count number of columns in dataframe python
Python
0 vote299 views1 answer
How to fix invalid salt in python flask
Python Flask
0 vote275 views1 answer
Patch loop runner _run_once
Python
0 vote268 views4 answers
Craeting a method that can take any number of arguments in python
Python
75 votes295 views6 answers
Working directory python
Python
0 vote239 views1 answer
How to put a image in flask
Python
2 votes245 views1 answer
Creating a 50 day and 100 day moving average python
Python
5 votes253 views5 answers
12 month movinf average in python for dataframe
Python