Q. What will be the recurrence relation of the code of recursive selection sort?

(A) t(n) = 2t(n/2) + n
(B) t(n) = 2t(n/2) + c
(C) t(n) = t(n-1) + n
(D) t(n) = t(n-1) + c

💬 Discuss

✅ Correct Answer: (C) t(n) = t(n-1) + n

Explanation: function to find the minimum element index takes n time.the recursive call is made to one less element than in the previous call so the overall recurrence relation becomes t(n) = t(n-1) + n.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

function to find the minimum element index takes n time.the recursive call is made to one less element than in the previous call so the overall recurrence relation becomes t(n) = t(n-1) + n.

💬 Discussion

📊 Question Analytics

👁️

790

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate

Q. What will be the recurrence relation of the code of recursive selection sort?

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics