/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

3 votes158 views1 answer
Sklearn train_test_split
Python
0 vote197 views1 answer
Pvm python
Python
4 votes157 views2 answers
How to get the system time in python
Python
19 votes163 views1 answer
Turn off warnings
Python
0 vote159 views1 answer
Find & replace in csv file
Python
16 votes152 views6 answers
Show all columns in pandas
Python
1 vote196 views3 answers
Pascal's triangle python
Python
0 vote212 views1 answer
Find a string hackereank
Python
0 vote209 views1 answer
Staticmethod vs classmethod python
Python
0 vote166 views1 answer
Update print python
Python