CS252 Algorithms
Monday, 19 September 2022

+ Problem problems: what if you're stuck?
- Think about brute force
- Think about *why* your ideas (brute force or
    otherwise) aren't the answer
- Play with a small example
- Talk to Jeff
- Talk to prefect (Lily Haas)
- Talk to classmates
- Don't assume the first problem is the easiest!

+ These particular problems
- What's on your mind?

+ Matching in Section 1.1
- the assumptions
    number of items in each set (men, women, etc.) equal
    each individual in M ranks all members of W
    each individual in W ranks all members of M
- real applications, these assumptions often/mostly not true
    different # of jobs and applicants
    job applicants don't rank all possible jobs
    CS students don't rank all the possible courses
    perfect info is hard/impossible to get
    ...
- the algorithm
- the proof
    - correctness
    - runtime
        - using up a resource one iteration at a time

+ Social implications
- assigning class project partners this way
    (say, in a 10-person class)
- a speed-dating night
- actors/writers/athletes & agents
- jobs and applicants (medical residency; internships; etc.)
- ...

+ What would be next?
- changing assumptions
    - does the algorithm still work?
    - no? how would you change it?
    - does the runtime change?