/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 vote184 views2 answers
Doormat pattern python
Python
0 vote177 views1 answer
Root.iconbitmap
Python
0 vote197 views1 answer
Y=mx+b python
Python
0 vote198 views1 answer
Jupyter notebook fancy print cross tab
Python
0 vote192 views1 answer
IntersectAll dynamo revit
Python
0 vote241 views1 answer
.defaultdict
Python
0 vote177 views2 answers
Python dictionary rename key
Python
0 vote167 views1 answer
Punto1
Python
0 vote189 views1 answer
Pandas dataframe to excel hyperlink length limit
Python
0 vote183 views1 answer
PHP echo multiple lines example Using concatenation assignment operator
Python