I am trying to design an algorithm that would help me distribute in this example case, 'students' to different exam rooms.
All the constraints for this Theoretical problem would be:
[1]"One student can only be at the exam room at a specific time "... meaning that only one student can give an exam in one of the rooms. No two students can share a room even if their exam starting times is exactly same.
[2]The number of rooms used has to remain a minimum.
[3] We could imagine that there are unlimited number of rooms that are available for use.
As inputs I only have the (sorted) exam starting times for students.
Can anyone suggest an algorithm which would always keep the number of "rooms used" to a minimum?
[Note: Multiple students may have the same exact starting times.]
