Computer Science, asked by kevbrown302, 6 months ago

Reorder the following efficiencies from smallest to largest:

Answers

Answered by saransrini03
0

Answer:

The order of the efficiencies is as following:-

10,000 < 2n < nlog(n) < n5 < n!.

Explanation:

2n this efficiency is linear it will grow proportionally as the size of the problem increases

Similar questions