/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

11 votes225 views1 answer
Python windows os.listdir path usage
Python
51 votes224 views3 answers
What is the rgb value of blue
Python
11 votes216 views3 answers
How to do pandas profiling
Python
0 vote245 views1 answer
Python global variable unboundlocalerror
Python
0 vote239 views1 answer
Pandas count show one column
Python
27 votes275 views3 answers
Python get the key with the max or min value in a dictionary
Python
6 votes231 views1 answer
How to reverse word order in python
Python
1 vote240 views2 answers
If number is divisible by 3 python
Python
2 votes213 views1 answer
Favicon django
Python
0 vote240 views1 answer
How to use list compression with conditional formatting
Python