Answer:
The computer can do 12000 searches per second. Suppose there are 60000 inventory items. And we need to search one item from it in a sequential manner. The computer can do 12000 searches in one second. Hence it can search in a list of 60000 inventory in 5 seconds, as 12000 x 5 =60000 searches, in the worst case. And if the item is below 12000 on the list, it will take less than 1 second(1/12000 sec in best case), and so on.
And if we assume that the list is sorted, and perform a binary search. then in the worst case, the number of searches required in the worst case will be 60000/2= 30000. And the time required will be 30000/12000= 5/2=2.5 seconds, and (1/24000) seconds in the best case. Its 1/24000 as its binary search.
Explanation:
Please check the answer section.
the function and loop will be
def factorial(x):
total = 1
if x != 1 and x != 0:
for i in range(x,1,-1):
total *= i
return total
The relationship between time and interest is: time allowed to repay the loan (monthly payments)
The best and most correct answer among the choices provided by the question is the first choice "miniaturization"<span>
A jet airliner (or jetliner<span>, or jet) is an airliner powered by jet engines (passenger jet aircraft). Airliners usually have two or four jet engines; three-engined designs were popular in the 1970s but are less common today.
</span>
I hope my answer has come to your help. God bless and have a nice day ahead!</span>
