> Sort the following Big O notations? O(N!), O(N), AND O(N^N) from the fastest to the lowest?

Sort the following Big O notations? O(N!), O(N), AND O(N^N) from the fastest to the lowest?

Sort the following Big O notations? O(N!), O(N), AND O(N^N) from the fastest to the lowest?

Posted at： 2014-12-18　
From fastest to slowest: O(N), O(N!), O(N^N)

An example to clarify.

N is a variable that determines the amount of lines that have to be compiled.

For the example I will assume that N is 5.

In the case of O(N) it will be 5 lines.

In the case of O(N!) it will be 1 * 2 * 3 * 4 * 5 = 120 lines.

In the case of O(N^N) it will be 5 * 5 * 5 * 5 * 5 = 3125 lines.
  • Previous： Want to join sap course. Which sap module is good for Cs background and fees details also.?
  • Next：Advantages of end user development software?