Each King or Queen is shown with his or her preferences, in order (top down). The objective of the assignment is to develop a solution based on the Gale-Shapley Algorithm.You will provide output...

Please use Source.cpp for reference. I need to alter the code so that it solves the same problem at hand but looks a little different, so it is not like it is a direct copy of this Source.cpp. The problem is on "Stable Marriage" (Gale-Shapley algorithm), more details in the files. The Source.cpp works as intended, the code just needs to be altered and perhaps maybe the output a little bit.


Each King or Queen is shown with his or her preferences, in order (top down). The objective of the assignment is to develop a solution based on the Gale- Shapley Algorithm. You will provide output indicating: Round n Queens proposal to: (a list of queens proposing to Kings) Kings engaged to: (a list of kings showing whom was accepted) Stable Marriage Imagine the starting point below (as in the video posted): The preferences are taken from the video. The order is based on the order of the Queens proposing in the first round: QS, QH, QD, and QC. One of the interestingi things that you can try doing is to see how the engagements differ should you change the order of proposals or switch so that the Kings propose and the Queens either accept or reject.