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:
a. input={4,4}
b. input={3,6,6}
c. input={7,8,8,4}
d. input={5,7,7,4,4}
e input={4,6,6,7,9,9}
Explanation:
First understanding the method in the method we are iterating over array upto the second last element and in the loop we are checking that the current element is less than then next array element if it is less then we are assigning the value of next element to the current element.So the outputs are stated above according to the method execution.
