Suppose a sorted list of 512 elements is searched with binary search. How many distinct list elements are compared against a search key that is greater than all elements in the list?

Write a program which uses linear Search to search the elements 45,and 78 and delete it. NUMBERS=[11,22,33,36,45,52,57,60,64,78]

Given a list mylist construct a dictionary mydict, the key is the index of an element in my list and its value will be the element value of mylist. for example the index of "a" is "0" . therefore the pair ( 0,"a" )will be in mydict .it means mydict = { 0:'a' ,1:'cybersecurity ', 2 : 'newyork'......}  Do this  in coding but not manually. given an empty dictionary mydict ={}  write a python code to construct mydict for any given list. Hint : Your Code begins with mydict={}for val in mylist:

Consider the following list: int list[] = (14, 18, 29, 35, 44, 49, 55, 58, 66, 71, 75, 80, 89, 95, 98) %3D When performing a binary search for 75, after the first comparison, the search is restricted to O list[8].. .list[14] O list [5]...list[11] O list[0].. .list[7] O list [0]. . .list[6]