![]() ![]() The schedule for a specific lecture is of the form (s time, f time) where s time represents the start time for that lecture and similarly the f time represents the finishing time. You are given a set of N schedules of lectures for a single day at a university.Some instances of the problem are as follows: Let's dive into an interesting problem that you can encounter in almost any industry or any walk of life. Usually, coming up with an algorithm might seem to be trivial, but proving that it is actually correct, is a whole different problem. ![]() Proving that a greedy algorithm is correct is more of an art than a science. Even with the correct algorithm, it is hard to prove why it is correct.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |