Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
Answer:
riodic Table
A museum wants to store their valuable documents in cases that contain a gas that will protect the documents.
She should not choose one of the other gases because they are too
The museum director should choose
Explanation:
I didn't understand
Optima battery because it is stronger than a factory battery
The relational operator used would probably be <=
Explanation:
The United States created the Environmental Protection Agency. in some ways they have did that
