166k views
1 vote
Which is the highest in complexity?

A. (n) * 2n

B. (n2) * n

C. n2

D.nlog(n)

E. 3n

User Fny
by
5.7k points

1 Answer

2 votes

Answer:

B. (n2) * n.

Step-by-step 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².

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.

User Desdenova
by
5.4k points