Computer Science · Analysis of Algorithms
बाइनरी तुलनाओं पर आधारित एक सॉर्टिंग एल्गोरिदम को n तत्वों को सॉर्ट करने के लिए सबसे खराब स्थिति में कम से कम कितनी तुलनाओं की आवश्यकता होती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1⌈log2(n!)⌉ / n
- 2⌈log2((n-1)!)⌉ / n
- 3⌈log2(n!)⌉✓
- 4⌈log2((n-1)!)⌉
सही उत्तर देखें
⌈log2(n!)⌉
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 Analysis of Algorithms MCQs →Want more practice questions on Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Analysis of Algorithms