Answer:
i) The time taken for 1500 records = 15 seconds.
ii) The time taken for 1500 records = 50 seconds.
Explanation:
A is an O(n) algorithm.
An algorithm with O(n) efficiency is described as a linearly increasing algorithm, this mean that the rate at which the input increases is linear to the time needed to compute that algorithm with n inputs.
From the question, it is given that for 1000 records, the time required is: 10 seconds.
Algorithm time taken is O(n)
Hence,
1) For 1,500 records
=> 10/1000 = x/1500
=> 10x1500/1000 = x
x = 15 seconds
Thus, the time taken for 1500 records = 15 seconds.
2) For 5,000 records
=> 10/1000 = x/5000
=> 10x5000/1000 = x
x = 50 seconds
Thus, the time taken for 1500 records = 50 seconds.
Answer:
The answer is most likely B
Explanation:
If it is a logic error, then the computer thinks it is doing the correct task.
<span>The Huns were a formidable force to fight. They were able to eat most food without problem which removes the needs for supply trains and such and encourages pillaging. Another reason is that their a cavalry based army which completely decimated roman military since the roman empire consist of flat land and they could outflank, outrun, and could whittle down an army with ease. They also are nomads which means you don't know where they're living and so you can't be on the attack which also gave an advantage. This points that the Huns are a force to be reckon with.</span>
Answer:
Tbh i dont even know
Explanation:
I had who i wanted to become president but i don't even know anymore
