PYTHON 3

PLEASE FOLLOW INSTRUCTIONS

#COMMENT STEPS PLEASE

Problem

Implement the binary search algorithm we discussed in class, but by using iteration.

The function iterativeBinarySearch() should return the index of the target if it exists in the array, or -1 if the element doesn't exist.

You will not receive any points if you implement linear search or recursive binary search.

Instructions from your teacher. Add new file 1- def averagePartition(array): Problem 3- def closestToTarget(array, target): closest_index = 0 5 for i in range(1, len(array)): 6 | if abs (array[i] - target)