

McqMate
Q. |
Stable marriage problem is an example of? |
A. | branch and bound algorithm |
B. | backtracking algorithm |
C. | greedy algorithm |
D. | divide and conquer algorithm |
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. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet