Which is the highest in complexity?

A. (n) * 2n

B. (n2) * n

C. n2

D. nlog (n)

E. 3n

B. (n2) * n.

Explanation:

The highest complexity is (n2) * n because on solving it will come out to be n³. So the growth rate is of cubical order which is the highest among the options.

(n) * 2n is of the order of square. On solving it will be 2n².

n² is also of the order of square.

nlogn complexity is less than n² but greater than n.

3n is of linear complexity. It has the lowest complexity among the options.