Question

JAVA: Which of the following shows a list of Big-Oh running times in order from slowest to fastest?

		O(1), O(N), O(N2), O(logN), O(2N)
		O(1), O(N), O(N3), O(2N), O(N!)
		O(logN), O(N!), O(N2), O(N3), O(2N)
		O(N!), O(2N), O(N2), O(N), O(logN)

Answer 1

Order of grows from shortest to largest running time is
constant - 1
logarithmic - log(N)
linear - N
quadratic - N^2
cubic - N^3
exponential - e^N
factorial - n!

list of Big-Oh running times in order from slowest to fastest is

O(1), O(N), O(N3), O(2N), O(N!)

Option 2