Stable marriage problem is an example of?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

Q. Stable marriage problem is an example of?

(A) branch and bound algorithm
(B) backtracking algorithm
(C) greedy algorithm
(D) divide and conquer algorithm

💬 Discuss

✅ Correct Answer: (B) backtracking algorithm

Explanation: stable marriage problem is an example for recursive algorithm because it recursively uses backtracking algorithm to find an optimal solution.

Explanation by: Mr. Dubey

stable marriage problem is an example for recursive algorithm because it recursively uses backtracking algorithm to find an optimal solution.

💬 Discussion

📊 Question Analytics

👁️

599

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate