this is the general task scheduling problem apply greedy algorithms On Sat, Dec 4, 2010 at 10:13 AM, Prims <[email protected]> wrote:
> You are given 'n' appointments. Each appointment contains startime and > endtime. You have to retun all conflicting appointments efficiently > > starttime and endtime can range from a few min to few years. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
