Use dynamic programming: 1) Sort the events in order of finishing time. f1, f2, f3, f4, ... fn
E(fn) = E(sn) + 1; Solve the above recursion sn is start time of event n On Wed, Feb 9, 2011 at 11:30 AM, Sachin Agarwal <sachinagarwa...@gmail.com>wrote: > Suppose I have a room and I want to schedule meetings in it. You're > given a list of meeting start and end times. Find a way to schedule > the maximum number of meetings in the room. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.