Computer Science · Algorithms
लीनियर सर्च एल्गोरिथम (Linear search algorithm) में सबसे खराब स्थिति (Worst-case scenario) तब होती है जब:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1आइटम एरे का अंतिम तत्व हो या उसमें मौजूद ही न हो✓
- 2आइटम एरे में अंत से दूसरा तत्व हो
- 3आइटम एरे का पहला तत्व हो
- 4आइटम एरे के बीच में कहीं हो
सही उत्तर देखें
आइटम एरे का अंतिम तत्व हो या उसमें मौजूद ही न हो
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