Question

Write a program (a3.py) that has 3 function definitions: magic-sequential(), magic-binary(), and main().

• You will write the code for the above functions.
• Both magic functions (magic-sequential() and magic-binary()) will look for a magic index in a given sorted list of distinct integers.
  • A magic index in a list myList[0 ... n-1] is defined to be an index i such that myList[i] = i .
  • Both functions receive the list as a parameter and return an integer: either the magic index, if one exists, or -1 if a magic index does not exist in the list. If more than one magic index exist, return the first one found.
• The function magic-sequential() must use sequential search to traverse the list.
• The function magic-binary() must use binary search to find the magic index.
  • You should not use any built-in python function or method to perform the search - you must write the logic for the search algorithm.
    • It's okay to use len(), print(), input(), int(), range(), append().
• The function main() must prompt the user to enter unique integers, in ascending order. Add these numbers to a list and then call both count functions passing the same list as a parameter. Print the results from both function calls.
• At the bottom of a3.py (after the three function definitions), call main() to execute the code.

Answer 1

Answer:

def magic_sequential(l):
for i in range(len(l)):
if(l[i]==i):
return i
return -1

def magic_binary(l):
start = 0
end = len(l)-1
  
while(start<end):
mid = int((start+end)/2)
if(l[mid]==mid):
return mid
elif(l[mid]>mid):
end = mid
else:
start = mid+1
return -1

def main():
n= int(input("Enter the number of integers to be entered in ascending order: "))
l=[]
while(n>0):
k = int(input("Enter number: "))
l.append(k)
n = n-1
  
print(magic_sequential(l))
print(magic_binary(l))
  
main()

Output:

PLEASE UPVOTE IF YOU FOUND THIS HELPFUL!