Question: Stable matching problem is an example of? a) Branch and bound algorithm b) Backtracking algorithm c) Greedy algorithm d) Divide and conquer algorithm 3) What
Stable matching problem is an example of?
a) Branch and bound algorithm
b) Backtracking algorithm
c) Greedy algorithm
d) Divide and conquer algorithm
3) What is the efficiency of Gale-Shapley algorithm used in stable marriage problem?
a) O(N)
b) O(N log N)
c) O(N2)
d) O(log N)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
