Big-O Notation

Front

Constant time complexity in Big-O notation

Back

O(1)

Front

Exponential time complexity in big-O notation

Back

O(2^n)

Front

Slowest time complexity?

Back

O (n!)

Front

Consistent notation for every execution?

Back

O(1)

Front

O(n!) is inefficient and has no practical use.

Back

False

Front

Notation that grows with input size

Back

O(n)

Front

Nested loop notation

Back

O(n^2)

Front

Polynomial time complexity in big-O notation

Back

O(n^2)

Front

Big-O identifies the most ____ algorithm for a purpose.

Back

Efficient

Front

Big-O calculation rules: Which is false?

Back

Focus only on polynomials