Click here to Skip to main content
11,702,929 members (64,615 online)
Rate this: bad
good
Please Sign up or sign in to vote.
See more: C++
Input. Set of jobs with start times and finish times.                                                Goal. Find maximum cardinality subset of mutually compatible jobs.
Posted 28-Aug-11 4:03am
Edited 28-Aug-11 5:44am
(no name)183K
v2
Comments
André Kraak at 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)

  Print Answers RSS
0 Maciej Los 415
1 Sergey Alexandrovich Kryukov 325
2 OriginalGriff 260
3 CHill60 120
4 Andy Lanng 119
0 OriginalGriff 8,379
1 Sergey Alexandrovich Kryukov 7,587
2 CPallini 4,947
3 Maciej Los 4,501
4 Mika Wendelius 3,566


Advertise | Privacy | Mobile
Web01 | 2.8.150819.1 | Last Updated 28 Aug 2011
Copyright © CodeProject, 1999-2015
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100