/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

1 vote117 views1 answer
Python trick big numbers visualisation
Python
0 vote351 views1 answer
Django on delete set default
Python Django
0 vote134 views1 answer
Using built-in crawlers is very simple. A minimal example is shown as follows.
Python
2 votes151 views2 answers
.items() python
Python
2 votes117 views1 answer
Qradiobutton example
Python
0 vote114 views1 answer
Fix certain parameters during curve fit python lambda
Python
-1 vote120 views1 answer
Count variable in class python
Python
0 vote143 views1 answer
Replace NaN value in pandas data frame with zeros
Python
0 vote183 views1 answer
Python split() source code
Python
4 votes137 views3 answers
Python list add element to front
Python