/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 vote223 views1 answer
Python to c++ compiler
Python
3 votes226 views1 answer
SSL: CERTIFICATE_VERIFY_FAILED with Python3
Python
1 vote222 views1 answer
Remove columns that contain certain names in pandas
Python
0 vote232 views1 answer
Python pick one item from list
Python
0 vote216 views3 answers
Remove nana from np array
Python
0 vote217 views2 answers
Convert MATLAB to Python Reddit
Python
-2 votes220 views3 answers
How to make turtle shape image smaller
Python
4 votes220 views4 answers
Interface graphique sur python
Python
0 vote228 views1 answer
Get all commands discord.py
Python
0 vote205 views1 answer
From flask import flask app = flask(__name__) @app.route("/") def hello_world(): return "<p>hello, world!</p>"
Python