Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2012:journals:jeanpaul:section1 [2012/01/14 22:28] – mugabej
+++ courses:cs211:winter2012:journals:jeanpaul:section1 [2012/01/14 22:29] (current) – mugabej
@@ Line 51: / Line 51: @@
 \\
 \\
-After re-reading this section, I still think that it is very hard to implement an algorithm that may satisfy both those who propose and those who are proposed to. In practice,it's hard to have a stable matching.Also, when the size of the individuals increases( if we go back to the applicants and companies/colleges, the problem increases its complexity and the solution becomes harder to find. So the question I have is: "To what extent can this solution be extended to solve the more complex problem involving applicants/companies?\\
+After re-reading this section, I still think that it is very hard to implement an algorithm that may satisfy both those who propose and those who are proposed to. In practice,it's hard to have a stable matching.Also, when the size of the individuals increases( if we go back to the applicants and companies/colleges), the problem increases its complexity and the solution becomes harder to find. So the question I have is: To what extent can this solution be extended to solve the more complex problem involving applicants/companies?\\
 After re-reading this section, I appreciated even more the way the approach of this problem was made: from a clearly complex problem, devise a simpler version of the problem whose solution may extend to the more complex problem. It's a very admirable process that is really useful in solving most of the problems.\\