Click here to Skip to main content
11,641,708 members (49,412 online)
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 4:03am
Edited 28-Aug-11 5:44am
(no name)182.6K
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 Mika Wendelius 260
1 DamithSL 248
2 Afzaal Ahmad Zeeshan 129
3 OriginalGriff 120
4 Sergey Alexandrovich Kryukov 80
0 Mika Wendelius 460
1 OriginalGriff 265
2 DamithSL 258
3 CPallini 169
4 Afzaal Ahmad Zeeshan 149


Advertise | Privacy | Mobile
Web03 | 2.8.150731.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