Computer Science · Analysis of Algorithms
'n' आकार के ऐरे (array) में अधिकतम और न्यूनतम तत्वों को खोजने के लिए डिवाइड एंड कॉन्कर (Divide and Conquer) एल्गोरिदम की समय जटिलता (time complexity) क्या है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n2)
- 2O(n log n)
- 3O(log n)
- 4O(n)✓
सही उत्तर देखें
O(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