Question

Question 30 What is output? my_list = [20.0, 6, 11, 3, 90, 3.3] my_list.sort first = 0 last - len(my_list) - 1 count = 0 num_to_find 100//5 while last >= first: mid = (first + last) // 2 count += 1 if my_list[mid] < num_to_find: first = mid + 1 elif my_list[mid] > num_to_find: last = mid - 1 else: print(mid, count) break 42 2 5 5 3 u 43

Answer 1

# Creation of list
my_list = [20.0, 6, 11, 3, 90, 3.3]
# Sorting of list
my_list.sort()

# intialization of first and last variable with the list index
first = 0
last = len(my_list) -1

# initialization of count variable to 0
count = 0
# intialization of number to be found out
num_to_find = 100//5


while last >=  first: # checking if we finished the list
    mid = (first + last) // 2 # finding the midpoint
    count += 1 # incrementing the count variable
    # if the mid value is lesser than the number to be found, changing the first value to change list
    if my_list[mid] < num_to_find:
        first = mid + 1
    # if the mid value is greater than the number to be found, changing the last value to change list
    elif my_list[mid] > num_to_find:
        last = mid + 1
    # if the mid value is equal to the number, we print the index and the iterations it took
    else:
        print(mid, count)
        break

The answer is

4 2