|
|
|
|
|
|
| Example(s):Palindrome, prime, armstrong, "linear search", reverse etc. | |
|
|
|
| Example(s):1575, 1632, 1539 (Only one at a time) | |
Write a method in python to search for a value in a given list (assuming that the elements in list are in ascending order) with the help of Binary Search method. The method should return -1, if the value not present else it should return position of the value present in the list.
|
|
def bSearch(L, key):
low = 0
high = len(L)1
found = False
while (low <= high) and (not found):
mid = (low+high)//2
if L[mid] == key:
found = True
elif L[mid] < key:
low = mid + 1
else:
high = mid 1
if found:
return mid+1 # may even be 'return mid'
else:
return 1
CSKC| Created: 11-Jan-2019 | Updated: 11-Jan-2019|CBSE12A-2015
