/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

0 vote305 views1 answer
P = pascal(3, 'upper', exact=False)
Python
1 vote326 views2 answers
Pyqt5 message box
Python
0 vote321 views1 answer
Merging df vertically
Python
0 vote289 views2 answers
Python discord bot wait for response
Python
6 votes297 views1 answer
How to create migrations in django
Python
1 vote354 views1 answer
Updating many to many field in django using pk
Python Django
0 vote275 views1 answer
Python strip txt
Python
0 vote305 views1 answer
Python PowerPoint
Python
1 vote308 views1 answer
Verificar se arquivo existe python
Python
0 vote309 views2 answers
Selenium delete cookies python
Python