Consider the challenge of constructing a daily schedule given a (potentially large) set of event options. For example, a student planning his or her day might choose from the following possible events:
|8:00||8:45||Breakfast with friends|
|8:50||10:30||Study for class|
You are to implement two different greedy approaches for constructing a schedule:
Your program should read in a text file, with each line specifying the start and end times (in military notation) and a description of a single event. For example, see events.txt. Your program should display two possible schedules, one generated using the Shortest event first approach and one using the Earliest end-time first approach. Each schedule should list the selected events in chronological order (one event per line) and should clearly identify the approach used. For example:
In completing this assignment, you are free to use classes in the official Java libraries, but you may not utilize any other classes that you did not write yourself. You should follow good object-oriented practices in completing the program, defining highly-cohesive and loosely-coupled classes as needed.