1.1 Give an algorithm

Question: Give an algorithm that given a list

$$ L = {(s_1,t_1).(s_2,t_2),...(s_n,t_n)} $$

and the votes

$$ v_1,v_2,...,v_f $$

of the f people in the group, computes the subset of movies that maximizes the number of people in the group that get to see a movie they voted for.

Answer:

1.2 Space and time

Question: Analyse the space and running time of your algorithm in terms of n and f.

Answer:

Space Time