Answer:
There is also an attachment below
Explanation:
Since we are talking about binary search, let's assume that the items are sorted according to some criteria.
Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.
N = 700000000.
So, number of comparisions can be log(N) = 29.3 = 29.
So, in the worst case it does comparisions 29 times
1 - 3 21 - 3 21 - 3 21 - 3 21 - 3 21 - 3 21 - 3 21 - 3 21 - 3 21 - 3 21 - 3 21 - 3 21 - 3 21 - 3 2
Assigning values at run time
Assigning values as command line argument, before execution of the program
It means multiplying or dividing by 10, 100, 1000, etc
Answer:
Computer can be classified into four categories based on size namely Micro, Mini, Mainframe and Super computer
Explanation: