Q. What will be the time complexity of the code to reverse stack recursively?

(A) o(n)
(B) o(n log n)
(C) o(log n)
(D) o(n2)

💬 Discuss

✅ Correct Answer: (D) o(n2)

Explanation: the recurrence relation for the recursive code to reverse stack will be given by-t(n)=t(n-1)+n.this is calculated to be equal to o(n2).

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

Explanation by: Mr. Dubey

the recurrence relation for the recursive code to reverse stack will be given by-t(n)=t(n-1)+n.this is calculated to be equal to o(n2).

💬 Discussion

📊 Question Analytics

👁️

787

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

91%

Success Rate

Q. What will be the time complexity of the code to reverse stack recursively?

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics