Test series

Question

An array ‘A’ of length n contains numbers {0, 1, 2}, numbers are present in array in arbitrary order.

The best sorting algorithms, takes 250 units of time when n = 100. If n = 450. The minimum time required by algorithm on same hardware __________ (Rounded off to integers).

Answer 1

The best sort for this is counting sort, which has a time complexity of O(n). As the range is significantly less than the number of inputs.

For 100 inputs => 250 seconds.

Then for 450 inputs => 2.5 x 450 = 1125.