/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 vote266 views1 answer
Find unique values in all columns in Pandas DataFrame
Python
0 vote140 views1 answer
Selenium.common.exceptions.elementclickinterceptedexception: message: element click intercepted:
Python
0 vote246 views3 answers
Flask socketio with gevent
Python Flask
0 vote193 views2 answers
How to use information from env variables in python
Python
17 votes197 views5 answers
Remove punctuation python
Python
26 votes292 views6 answers
Remove spaces in string python
Python
3 votes189 views1 answer
PIL image example
Python
0 vote193 views1 answer
Start virtualenv with python version
Python
1 vote258 views1 answer
Flask send client to another web page
Python
-86 votes188 views10 answers
Code
Python