And what is the question?
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.
The light bulb is important because it helps you see in the dark.
The light bulb is a round object that produces light from energy.
People can't live without the light bulb because it helps you out a lot such as see in the dark like when you do homework at night.
It could help businesses profit because many will want to buy it cause they can be cheap but many will sell and it could help you a lot!
