Code to implement iterative Binary Search

Outrageous Ostrich answered on April 10, 2022 Popularity 9/10 Helpfulness 4/10

answer Code to implement iterative Binary Search

Code to implement iterative Binary Search

Comment

# code to implement iterative Binary Search.
def binarySearchIterative(arr, l, r, x):
	while l <= r:
		mid = l + (r - l) // 2;
		if arr[mid] == x:
			return mid
		elif arr[mid] < x:
			l = mid + 1
		else:
			r = mid - 1
	return -1
arr = [ 4, 9, 8, 20, 80 ]
find = 80
result = binarySearchIterative(arr, 0, len(arr)-1, find)
if result != -1:
	print ("Element is present at index % d" % result)
else:
	print ("Element is not present in array")

Popularity 9/10 Helpfulness 4/10 Language python

Source: softhunt.net

Tags: binary-search python

Link to this answer
Share Copy Link

Contributed on Apr 10 2022

Outrageous Ostrich

0 Answers Avg Quality 2/10

Code to implement iterative Binary Search

Contents

More Related Answers

Code to implement iterative Binary Search

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.