steve22
- 4
- 0
help with greedy algortitm please!
Hi Guys
I have a big problem which is bugging me. Basically the problem is about agreedy algorithm. I have attached the problem which would be similer to what I would get in the exam. I am really confused about the question I would like to get help from anyone please or example of how to solve the problem.
the problem is about
Each of ten students A-J have chosen 3 modules out of eight available as follows:
Discuss how the Greedy Algorithm can be applied to this problem and hence insert subjects into slots in such a way as to minimise the number of students who have a timetable clash.
Ive attached the problem. I would be very greatful if me anyone can help me with this question it would be very helpful to
Homework Statement
Hi Guys
I have a big problem which is bugging me. Basically the problem is about agreedy algorithm. I have attached the problem which would be similer to what I would get in the exam. I am really confused about the question I would like to get help from anyone please or example of how to solve the problem.
the problem is about
Each of ten students A-J have chosen 3 modules out of eight available as follows:
Discuss how the Greedy Algorithm can be applied to this problem and hence insert subjects into slots in such a way as to minimise the number of students who have a timetable clash.
Ive attached the problem. I would be very greatful if me anyone can help me with this question it would be very helpful to