Question

What does Big O notation primarily describe?

A The exact running time of an algorithm in milliseconds.
B The space complexity of an algorithm.
C The upper bound or worst-case growth rate of an algorithm's running time or space requirements.
D The average-case performance of an algorithm.
E The best-case scenario for an algorithm's execution.
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)