/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 vote267 views2 answers
How to add and subtract days datetime python
Python
0 vote178 views1 answer
Numpy array with 2 times each value
Python
0 vote195 views1 answer
Mp.solutions.findhands not in python 3.8
Python
-1 vote194 views1 answer
Python all any example
Python
1 vote197 views1 answer
Df.select_dtypes
Python
0 vote174 views1 answer
Import re #your code goes here number=input() pattern=r"(1|8|9)[0-9]+" match=re.match(pattern,number) of lane(number)==8: if(match): print("value") else: print("invalid") else print("invalid")
Python
0 vote193 views1 answer
Cbv uk django
Python
21 votes214 views4 answers
Send dm discord py
Python
0 vote237 views1 answer
Iloc[:,0:-1]
Python
0 vote191 views1 answer
StringIndexer pyspark
Python