Stable marriage problem is an example of?
|A.||branch and bound 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.|
Login to Continue
It will take less than 2 minutes