Answer:
B and C
As the size of the list grows, the number of steps needed to sort the list grows at a linear rate, as the number of steps is equal to 10n
10n for a list of size n
n. This is an example of a polynomial efficiency and indicates that the algorithm runs in a reasonable amount of time.
The number of steps for this algorithm is equal to the length of the list squared, as the number of steps is equal to n
n2 for a list of size n
This is an example of a polynomial efficiency and indicates that the algorithm runs in a reasonable amount of time.
(Hope this helps)
