Write a function that takes a sorted list and a number as an argument.

1.	Write a function that takes a sorted list and a number as an argument. Search for the number in the sorted list using binary search.
Answer» def binary_search(SORTEDLIST, number): low=0 high=len(SORTEDLIST) found=False while(low<high) and found==False: mid=(int) (low+high/2) if SORTEDLIST[mid]==number: print “Number found at”,mid found=True break elif SORTEDLIST[mid]<number: low=mid+1 else: high=mid-1 if low >= high: print “Number not found” maxrange = inputfEnter Count of numbers: ”) numlist = [] for i in range(0, maxrange): numlist.append(input(“?”)) numlist.sort() print “Sorted list”,numlist number = inputfEnter the number”) binary_search(numlist,number)

Write a function that takes a sorted list and a number as an argument. Search for the number in the sorted list using binary search.

Answer»

def binary_search(SORTEDLIST, number):

low=0

high=len(SORTEDLIST)

found=False

while(low<high) and found==False:

mid=(int) (low+high/2)

if SORTEDLIST[mid]==number:

print “Number found at”,mid

found=True

break

elif SORTEDLIST[mid]<number:

low=mid+1

else:

high=mid-1

if low >= high:

print “Number not found”

maxrange = inputfEnter Count of numbers: ”)

numlist = []

for i in range(0, maxrange):

numlist.append(input(“?”))

numlist.sort()

print “Sorted list”,numlist

number = inputfEnter the number”)

binary_search(numlist,number)

Discussion

No Comment Found

Related InterviewSolutions

What will be the status of the following list after the First. Second and Third pass of the insertion sort method used for arranging the following elements in descending order ?12,34,46, -34,90,23Note : Show the status of all the elements after each pass very clearly underlining the changes.
Sort a list containing names of students in ascending order using selection sort.
In the following list containing integers, sort the list using Insertion sort algorithm.Also show the status of the list after each iteration.15 -5 20 -10 10
A list contains rollno, name and marks of the student. Sort the list in descending order of marks using selection sort algorithm.
Write an algorithm for selection sort.
Consider the following unsorted list: 90 78 20 46 54 1 Write the list after:1. 3rd iteration of selection sort2. 4th iteration of bubble sort3. 5th iteration of insertion sort Ans. Working :
What will be the status of the following after the First, Second and Third pass of the insertion sort method used for arranging the following elements in descending order ?Note: Show the status of all the elements after each pass very clearly underlining the changes.
Consider the following unsorted list:99 78 25 48 51 11Sort the list using selection sort algorithm. Show the status of the list after every iteration.
Consider the following list 95 79 19 43 52 3Write the passes of bubble sort sorting the list in ascending order till the 3rd iteration.
Write a function that takes a sorted list and a number as an argument. Search for the number in the sorted list using binary search.