/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 vote278 views1 answer
Pyglet on close
Python
3 votes206 views1 answer
Randonm forest python
Python
0 vote236 views1 answer
Split string by delimiter string
Python
0 vote260 views1 answer
Unreadable Notebook: jupyter
Python
1 vote276 views1 answer
Pyhton turtle kill
Python
1 vote280 views1 answer
How many data types are specified to numeric values in python
Python
0 vote270 views1 answer
Pycharm writing issue
Python
1 vote256 views1 answer
Python if elif else in one line
Python
2 votes276 views3 answers
Group by month and day pandas
Python
0 vote295 views1 answer
Générer des valeurs de 0 à n python liste
Python