Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
courses:cs211:winter2018:journals:holmesr:section_1.1 [2018/01/17 01:44] holmesrcourses:cs211:winter2018:journals:holmesr:section_1.1 [2018/01/21 17:37] (current) holmesr
Line 1: Line 1:
-====== Section 1.1 ======+====== Chapter 1 ====== 
 + 
 +===== Section 1.1 =====
  
 Section 1.1 deals with the Stable Matching Problem. The algorithm that solves this problem can be used for a variety of different applications, including matching residents with hospitals, job candidates with jobs, or freshman girls with sororities. We will talk about it in terms of matching men and women in monogamous, heteronormative relationships.  Section 1.1 deals with the Stable Matching Problem. The algorithm that solves this problem can be used for a variety of different applications, including matching residents with hospitals, job candidates with jobs, or freshman girls with sororities. We will talk about it in terms of matching men and women in monogamous, heteronormative relationships. 
courses/cs211/winter2018/journals/holmesr/section_1.1.1516153440.txt.gz · Last modified: by holmesr
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0