There are n men and n women. I am unable to understand how stable matching done by simply searching through all the matchings takes n! steps i.e., I cannot figure out why there are n! matchings possible.
Why does stable matching without Gale-Shapely takes n! steps
algorithms