Computer Science · Data Structures and Algorithms
सर्वोत्तम/औसत/सबसे खराब स्थिति की समय जटिलताओं (time complexities) के संबंध में सूची I को सूची II से सुमेलित कीजिए: सूची I (एल्गोरिदम)सूची II (जटिलता)A. इंसर्शन सॉर्ट (सर्वोत्तम स्थिति)I. O(log n)B. बाइनरी सर्चII. O(n2)C. क्विक सॉर्ट (औसत स्थिति)III. O(n)D. सेलेक्शन सॉर्टIV. O(n log n) नीचे दिए गए विकल्पों में से सही उत्तर चुनिए:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - II, B - III, C - IV, D - I
- 2A - I, B - II, C - IV, D - III
- 3A - II, B - III, C - I, D - IV
- 4A - III, B - I, C - IV, D - II✓
सही उत्तर देखें
A - III, B - I, C - IV, D - II
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 and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms