Added Greedy Algo/Job Sequencing/C++/job_sequencing.cpp

Author: shubhamgpt198

Greedy Algorithms/Job Sequencing/C++/job_sequencing.cpp

@@ -0,0 +1,65 @@
+// Program to find the maximum profit job sequence from a given array of jobs with deadlines and profits 
+
+#include<iostream> 
+#include<algorithm> 
+using namespace std; 
+
+// A structure to represent a job 
+struct Job 
+{ 
+char id;	   // Job Id 
+int deadline; // Deadline of job 
+int profit;  // Profit if job is over before or on deadline 
+}; 
+
+// This function is used for sorting all jobs according to profit 
+bool compare(Job a, Job b) 
+{ 
+	return (a.profit > b.profit); 
+} 
+
+// Returns minimum number of platforms reqquired 
+void ShowJobSequence(Job arr[], int n) 
+{ 
+	// Sort all jobs according to decreasing order of prfit 
+	sort(arr, arr+n, compare); 
+
+	int result[n]; // To store result (Sequence of jobs) 
+	bool slot[n]; // To keep track of free time slots 
+
+	// Initialize all slots to be free 
+	for (int i=0; i<n; i++) 
+		slot[i] = false; 
+
+	// Iterate through all given jobs 
+	for (int i=0; i<n; i++) 
+	{ 
+	// Find a free slot for this job (Note that we start 
+	// from the last possible slot) 
+	for (int j=min(n, arr[i].deadline)-1; j>=0; j--) 
+	{ 
+		// Free slot found 
+		if (slot[j]==false) 
+		{ 
+			result[j] = i; // Add this job to result 
+			slot[j] = true; // Make this slot occupied 
+			break; 
+		} 
+	} 
+	} 
+
+	// Print the result 
+	for (int i=0; i<n; i++) 
+	if (slot[i]) 
+		cout << arr[result[i]].id << " "; 
+} 
+
+// Program to test methods 
+int main() 
+{ 
+	Job arr[] = { {'a', 2, 100}, {'b', 1, 19}, {'c', 2, 27}, {'d', 1, 25}, {'e', 3, 15}}; 
+	int n = sizeof(arr)/sizeof(arr[0]); 
+	cout << "Maximum profit sequence of jobs is: \n"; 
+	ShowJobSequence(arr, n); 
+	return 0; 
+}