Computer Science · Algorithms
समय जटिलता (Time complexity) विश्लेषण के लिए सूची-I (अल्गोरिदम) को सूची-II (पुनरावृत्ति संबंध/Recurrence relation) के साथ सुमेलित करें: सूची-I (अल्गोरिदम) (A) बाइनरी सर्च (Binary Search) (B) मर्ज सॉर्ट (Merge Sort) (C) क्विक सॉर्ट (Quick Sort - वर्स्ट-केस पार्टीशनिंग) (D) लीनियर सर्च (Linear Search) सूची-II (पुनरावृत्ति संबंध) (I) T(n) = T(n / 2) + c (II) T(n) = 2T(n / 2) + Θ(n) (III) T(n) = T(n - 1) + Θ(n) (IV) T(n) = T(n - 1) + c (जहां c एक स्थिरांक है) सही मिलान विकल्प चुनें:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(A) - (III), (B) - (IV), (C) - (I), (D) - (II)
- 2(A) - (I), (B) - (II), (C) - (IV), (D) - (III)
- 3(A) - (I), (B) - (III), (C) - (II), (D) - (IV)
- 4(A) - (I), (B) - (II), (C) - (III), (D) - (IV)✓
सही उत्तर देखें
(A) - (I), (B) - (II), (C) - (III), (D) - (IV)
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