Your final exams are over and you are catching up on watching sports on TV. You have a schedule of interesting matches coming up all over the world during the next week. You hate to start or stop watching a match midway, so your aim is to watch as many complete matches as possible during the week.
Suppose there are $n$ such matches scheduled during the coming week and you know the starting and finishing time for each match.
Develop an algorithm based on dynamic programming to compute the maximum number of complete matches you can watch next week. Analyze the worse-case complexity of your algorithm.
arjun sir, i need ur favour,so that i may solve the problem
Is this problem a bit similar to NON-PRE-EMPTIVE SJF:
where start time of match is same as ARRIVAL TIME of process.
end time of match is same as COMPLETION TIME of process.
time duration of match is same as BURST TIME of process.
hate to start & stop is same as non-pre-emption.
In d link mentioned below. Yeah. :)