Big O Notation

Indicate constant time complexity in terms of Big-O notation

• O(N)

• O(log N)

• O(1)

• O(N^2)

Indicate exponential time complexity in terms of big-O notation

• O(N)

• O(n^2)

• O(2^n)

• O(log n)

Which is the most efficient in terms of Big O?

• O(2^n)

• O(n^2)

• O(1)

• O(n!)

Which is the least efficient in terms of Big O?

• O(N)

• 0(n!)

• O(1)

• O(n^2)

What is considered when calculating efficiency with Big O?

• CPU Power

• Dominant Terms

• Constant Terms

• Polynomial Terms

Which notation grows in proportion to the size of the input?

• O(1)

• O(N)

• O(2^N)

• O(5)

What notation is usually associated with a nested loop?

• O(N)

• O(N^2)

• O(2^N)

• O(2N)

Big O notation identifies the _________ case scenario.

• Best

• Linear

• Worst

• Constant

• O(500)

• O(3n)

• O(n^2)

• O(140)

• O(n!)

• O(n^2)

• O(5)

• O(14)