Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Programming
Time & Space Complexity
Question
Easy
tcs-nqt
Which notation describes the UPPER BOUND of an algorithm's running time?
A
Omega (Ω)
B
Theta (Θ)
C
Big-O (O)
D
Little-o (o)
Show Answer
← Back to Time & Space Complexity questions
Which notation describes the UPPER BOUND of an algorithm's running time? | Time & Space Complexity MCQ | TomoLink | TomoLink
