Scribd
Upload
9 views2 pages

Ads Ex-9

Uploaded by

sirishaksnlp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views2 pages

Ads Ex-9

Uploaded by

sirishaksnlp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

9. Aim: C++ Program to implement job sequence with deadline using Greedy method.

Sourcr Code:
#include<iostream>
#include<algorithm>
using namespace std;
struct Job
{
char id;
int deadLine;
int profit;
};
bool comp(Job j1, Job j2)
{
return (j1.profit > j2.profit); //compare jobs based on profit
}
int min(int a, int b)
{
return (a<b)? a:b;
}
int main()
{
Job jobs[] = { { 'a', 2, 100 },
{ 'b', 2, 20 },
{ 'c', 1, 40 },
{ 'd', 3, 35 },
{ 'e', 1, 25 } };
int n = 5;
cout << "Following is maximum profit sequence of Jobs: "<<"\n";
sort(jobs, jobs+n, comp); //sort jobs on profit
int jobSeq[n]; // To store result (Sequence of jobs)
bool slot[n]; // To keep track of free time slots
for (int i=0; i<n; i++)
slot[i] = false; //initially all slots are free
for (int i=0; i<n; i++)
{ //for all given jobs
for (int j=min(n, jobs[i].deadLine)-1; j>=0; j--)
{ //search from last free slot
if (slot[j]==false)
{
jobSeq[j] = i; // Add this job to job sequence
slot[j] = true; // mark this slot as occupied
break;
}
}
}
for (int i=0; i<n; i++)
if (slot[i])
cout << jobs[jobSeq[i]].id << " "; //display the sequence
}
Output:
Following is maximum profit sequence of Jobs:
cad

You might also like