Computer Science · Data Structures
Which of the following asymptotic notations represents the tight bound for the best-case time complexity of a standard sorting algorithm?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Omega (Ω)
- 2Theta (θ)✓
- 3Big Oh (O)
- 4Small Omega (ω)
Correct answer
Theta (θ)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures