Click here to Skip to main content
Rate this: bad
good
Please Sign up or sign in to vote.
See more: C++ GimmeCode Homework
Input. Set of jobs with start times and finish times.                                                Goal. Find maximum cardinality subset of mutually compatible jobs.
Posted 28-Aug-11 5:03am
Edited 28-Aug-11 6:44am
(no name)177.7K
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 Marcin Kozub 310
1 OriginalGriff 248
2 Sergey Alexandrovich Kryukov 215
3 Richard MacCutchan 202
4 Praneet Nadkar 197
0 OriginalGriff 8,048
1 Sergey Alexandrovich Kryukov 7,287
2 DamithSL 5,614
3 Manas Bhardwaj 4,986
4 Maciej Los 4,910


Advertise | Privacy | Mobile
Web04 | 2.8.1411023.1 | Last Updated 28 Aug 2011
Copyright © CodeProject, 1999-2014
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