Computer Science · Algorithms
An unordered list contains n distinct elements. What is the number of comparisons required in the worst-case to find an element in this list that is neither the maximum nor the minimum?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Θ(n log n)
- 2Θ(n)
- 3Θ(1)✓
- 4Θ(log n)
Correct answer
Θ(1)
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 Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms