Question

Requirements Write functions isMemberR, a recursive function, and isMemberI, which will use an iterative approach, to implement a binary search algorithm to determine whether a given element is a member of a given sequence Each function will have two parameters, aseq, a sorted sequence, and target. isMemberR and isMemberI will return True if target is an element of the sequence, and False otherwise. Your implementations must implement the binary search algorithm described above. When function i sMemberR recursively invokes itself, the sequence it passes on the recursive call should be a slice of the original sequence. To test the search functions, write function bintest, a new version of the test function you wrote for Project 6-1. Results will be similar to last time, for example: Checking isMemberR ((99, 100), 101).. .its value False is correct! Checking isMemberI ((2, 10), 10)... its value True is correct! Finally, write a main function that calls bintest two times: def main ) calls string reverse test func 2 times"' bintest (isMemberR) print(.) bintest (isMemberI) return None The last line in your py file should be a call to function main.

Answer 1

Given below is the code (tested on python 3.5) for the question.
************ EVERYTHING IS DONE. YOU JUST NEED TO COPY THE bintest() FROM YOUR PROJECT 6-1 AS MENTIONED IN QUESTION.. SINCE YOU HAVE NOT GIVEN THAT CODE, I HAVE JUST LEFT PLACE WITH COMMENT WHERE YOU NEED TO COPY THE bintest()*****************
Make sure to indent the code exactly as shown in image. INDENTATION IS LOST WHEN CODE IS UPLOADED ON CHEGG SITE
Please don't forget to rate the answer if it was helpful. Thank you
Let me know in case you need some help to integrate your previous code into this one.

null

#iterative function
def isMemberI(aseq, target):
start = 0
end = len(aseq) - 1
while start <= end:
mid = (start + end) // 2
if aseq[mid] == target:
return True
elif target < aseq[mid]:
end = mid - 1
else:
start = mid + 1

return False

#recursive function
def isMemberR(aseq, target):
if not aseq:
return False

mid = (len(aseq) - 1) // 2
if target == aseq[mid]:
return True
elif target < aseq[mid]:
return isMemberR(aseq[0, mid], target)
else:
return isMemberR(aseq[mid+1:], target)

#function bintest TO COPY FROM project 6
def bintest():
#TODO
return

def main():
bintest(isMemberR)
print()
bintest(isMemberI)
print()
return None

main()