/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 vote97 views1 answer
Small Python Game
Python
1 vote139 views1 answer
Python saveAsTextFile
Python
6 votes101 views2 answers
Python square a number
Python
7 votes100 views2 answers
Press key on python
Python
1 vote94 views1 answer
For loop django template count
Python
0 vote95 views1 answer
Define a python function day_of_week, which displays the day name for a given date supplied in the form (day,month,year).
Python
33 votes101 views4 answers
Python check folder exist
Python
8 votes103 views1 answer
Python how to check if a dictionary key exists
Python
15 votes95 views6 answers
Google translation
Python
5 votes92 views1 answer
Tkinter max size
Python