Is the stable matching problem greedy or Dynamic ? Please anyone can give a strong explanation as i tried to find it on the net but it isn't available.
If you consider the Gale–Shapley algorithm, it takes a greedy approach.
By the definition of Wikipedia:
A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum.
The Gale-Shapley Algorithm does exactly that. At each step, the 'proposers' take a greedy decision of selecting the best partner (locally optimal choice) that was not yet proposed.
Problems are not greedy or dynamic. Algorithms might use a greedy heuristic or the dynamic programming paradigm.
The usual algorithm for solving the stable matching problem is iterative, and so fits to neither the greedy paradigm nor the dynamic programming paradigm. You might as well have asked whether quicksort were greedy or dynamic programming.
If you are asking about the Gale-Shapley algorithm, GS algorithm is not greedy.
A greedy algorithm is one that does not change its decision once made.