Question

a computer scientist is analyzing four different algorithms used to sort a list. the table below shows the number of steps each algorithm took to sort lists of different sizes. list size number of steps for algorithm a number of steps for algorithm b number of steps for algorithm c number of steps for algorithm d 1 10 2 1 1 2 20 4 2 4 3 30 8 6 9 4 40 16 24 16 5 50 32 120 25 based on the values in the table, which of the algorithms appear to run in reasonable time? select two answers. algorithm a option a,algorithm a algorithm b option b,algorithm b algorithm c option c,algorithm c algorithm data

Answer 1

Algorithm A and Algorithm D.

Reason: A grows linearly (10, 20, 30, 40, 50 ≈ 10n). D grows quadratically (1, 4, 9, 16, 25 = n^2). B is exponential (2,4,8,16,32 = 2^n) and C is factorial (1,2,6,24,120 = n!), which become infeasible much faster.