📚 dsaflash.cards
Problems
Log in
Sign up
Home
/
Big O Notation
/
Asymptotic Notation
Asymptotic Notation
Question 1 of 6
What does Big O notation describe?
A
An upper bound on the growth rate of an algorithm's resource use
B
The exact number of operations an algorithm performs
C
The worst-case runtime of an algorithm
D
The average runtime across all possible inputs
← Back to categories