Click here to Skip to main content
15,892,059 members
Please Sign up or sign in to vote.
1.00/5 (4 votes)
See more:
Input. Set of jobs with start times and finish times. Goal. Find maximum cardinality subset of mutually compatible jobs.
Posted
Updated 28-Aug-11 5:44am
v2
Comments
André Kraak 28-Aug-11 10:53am    
Just for the fun of it I entered your second sentence in Google and the first five result were teaching assignments.
If you really want to learn programming try solving the problem yourself.
If you are having problems with a specific part of your solution post a new question and we will try to help you.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900