Back to marketplace

Time Complexities

No description yet. This curated deck is ready for daily study.

Total cards: 7•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (7)

#1
Front (Question)

What is Constant time complexity?

Back (Answer)

• O (1) • Time is independent of input • Example: Determining if a number is odd / even.

#2
Front (Question)

What is Linear time complexity?

Back (Answer)

• O (n) • Worst case scenario: must go through each item once. • Example: Linear search

#3
Front (Question)

What is Polynomial time complexity?

Back (Answer)

• O (n²) • A loop inside a loop • Example: Bubble sort

#4
Front (Question)

What is a Logarithmic time complexity?

Back (Answer)

• O (logn) • Halves the number of items in each iteration • Example: Binary search

#5
Front (Question)

What is a Linear Logarithmic time complexity?

Back (Answer)

• O (nlogn) • N / A • Example: Merge sort

#6
Front (Question)

What is an Exponential time complexity?

Back (Answer)

• O (2^n) • Intractable • Example: Recursively calculating Fibonacci numbers

#7
Front (Question)

What is a Factorial time complexity?

Back (Answer)

• O (n!) • Intractable • Example: Travelers problem