/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

8 votes379 views2 answers
Python print combinations of string
Python
0 vote374 views1 answer
Pycharm Error: Please select a valid Python interpreter
Python
0 vote379 views1 answer
Youtube-dl python get file name
Python
1 vote337 views1 answer
$ sudo pip install pdml2flow-frame-inter-arrival-time
Python
0 vote341 views1 answer
Pandas read excel nan
Python
2 votes339 views3 answers
Weather today
Python
2 votes313 views1 answer
@transactional annotation
Python
0 vote339 views1 answer
How to edit a pdf file in python
Python
4 votes341 views8 answers
Is this a rickroll
Python
0 vote362 views1 answer
Update all packages using pip on Windows
Python