New Commit

Author: coder-mayank22

activity_select.c

@@ -0,0 +1,85 @@
+#include <stdio.h>
+int start[100], end[100], acti[100];
+
+void sort (int act) //Sorting the activities wrt finish time
+{
+	int temp, i, j, temp2;
+	for (i= act-1;i>=1; i--)
+	{
+		for (j=1;j<=i;j++)
+		{
+			if (end[j-1]>end[j])
+			{
+				temp = end[j];
+				end[j]= end[j-1];
+				end[j-1] = temp;
+				
+				temp2 = start[j];
+				start[j] = start[j-1];
+				start[j-1] = temp2;
+			}
+		}
+	}
+}
+
+
+void activity_sel (int act)
+{
+	int i,j, c=0;
+	acti[0] = 0;
+	j = 0;
+	for (i=1;i<act;i++)
+	{
+		if (start[i]>=end[j])
+		{
+			acti[i] = i;
+			j=i;
+			c++;
+		}
+		else
+			c++;
+	}
+	
+	printf ("Activity set: ");
+	for (i = 0; i<=c; i++)
+		printf ("%d", acti[i]);
+	printf ("\n");
+}
+
+
+int main ()
+{
+	int i, act, wish;
+	do
+	{
+		printf ("Enter the number of Activities to be done: ");
+		scanf ("%d", &act);
+		
+		printf ("Enter the start and end time of the activities: \n");
+		for (i =0;i<act;i++)
+		{
+			printf ("%d-->", i+1);
+			printf ("Start Time: ");
+			scanf ("%d", &start[i]);
+			printf ("\tEnd Time: ");
+			scanf ("%d", &end[i]);
+		}
+			
+		
+		sort (act);
+		
+		printf ("Start set: ");
+		for (i = 0; i<act; i++)
+			printf ("%d", start[i]);
+		printf ("\n");
+		printf ("End   set: ");
+		for (i = 0; i<act; i++)
+			printf ("%d", end[i]);
+		printf ("\n");
+		
+		activity_sel (act);
+		
+		printf ("Do you want to continue? (1/0): ");
+		scanf ("%d", &wish);
+	}while (wish!=0);
+}

activity_select.exe

@@ -0,0 +1,101 @@
+#include <stdio.h>
+float wt[100], pt[100];
+float pw[100];
+int capacity;
+
+void sort(int n)
+{
+	int i, j;
+	float t, t1, t2;
+	for(int i=0;i<n-1;i++)
+	{
+		for(int j=0;j<n-1-i;j++)
+		{
+			if(pw[j]<pw[j+1]){
+				t= pw[j];
+				t1 = wt[j];
+				t2 = pt[j];
+				
+				pw[j] = pw[j+1];
+				wt[j] = wt[j+1];
+				pt[j] = pt[j+1];
+				
+				pw[j+1] = t;
+				wt[j+1] = t1;
+				pt[j+1] = t2;
+			}
+		}
+	}
+}
+
+void knapsack(int capacity, int n)
+{
+	int i,k=0;
+	float mul, profit = 0;
+    // Calculating the unit profit values
+	for(i = 0; i<n; i++)
+	{
+		pw[i] = pt[i]/wt[i];
+	}
+
+	sort(n); // Sorting the arrays wrt unit profit pw
+	
+	/*for (i=0;i<n;i++)
+	{
+		printf("%f  ", pw[i]);
+	}
+	printf ("\n");
+	for (i=0;i<n;i++)
+	{
+		printf("%f  ", pt[i]);
+	}
+	printf ("\n");
+	for (i=0;i<n;i++)
+	{
+		printf("%f  ", wt[i]);
+	}
+	printf ("\n");
+	*/
+
+	while(capacity != 0)
+	{
+		if(capacity >= wt[k])
+		{
+			capacity = (float)capacity - wt[k];
+			profit = profit+pt[k];
+			k++;
+		}
+		else
+		{
+			mul = capacity/wt[k];
+			wt[k] = wt[k]*mul;
+			pt[k] = pt[k]*mul;
+			capacity = (float)capacity - wt[k];
+			profit = profit + pt[k];
+			k++;
+		}
+	}
+	printf("The Maximum profit that can be made is: %f", profit);
+}
+
+
+int main()
+{
+	int n,i;
+	printf("Enter the number of weights and profit: ");
+	scanf("%d", &n);
+	
+	printf("Enter the capacity of the knapsack: ");
+	scanf("%d", &capacity);
+	
+	for(i = 0; i< n; i++)
+	{
+		printf("Weight: ");
+		scanf("%f", &wt[i]);
+		printf("Profit: ");
+		scanf("%f", &pt[i]);
+	}
+	
+	
+	knapsack(capacity, n);
+}

fractional_knapsack.c

@@ -0,0 +1,80 @@
+#include<stdio.h>
+
+int p[100], jobs, d[100], final_dead[100];
+
+void input(){
+	printf("Enter the profits and deadlines\n\n");
+	for(int i=0;i<jobs;i++){
+		printf("Job %d\n", i+1);
+		printf("Profit : ");
+		scanf("%d", &p[i]);
+		printf("Deadline : ");
+		scanf("%d", &d[i]);
+	}
+	printf("\n");
+}
+
+void sort(){
+	int i, j, t1, t2;
+	for(i=0;i<jobs-1;i++){
+		for(j=0;j<jobs-1-i;j++){
+			if(p[j]<p[j+1]){
+				t1 = p[j];
+				t2 = d[j];
+				
+				p[j] = p[j+1];
+				d[j] = d[j+1];
+				
+				p[j+1] = t1;
+				d[j+1] = t2;
+			}
+		}
+	}
+}
+
+void jobSelection(){
+	sort();
+	int i, j;
+	printf("Profit Array: ");
+	for(i=0;i<jobs;i++){
+		printf("%d ", p[i]);
+	}
+	
+	printf("\nDeadlines: ");
+	for(i=0;i<jobs;i++)
+	printf("%d ", d[i]);
+	
+	int max = d[0];
+	for(i=0;i<jobs;i++)
+	if(d[i]>max) max = d[i];
+	
+	int profit = 0; //Stores the maximum profit
+	
+	for(i=0;i<max;i++)
+	final_dead[i] = 0;
+	
+	for(i=max;i>=0;i--){
+		if(final_dead[i]!=0)
+		continue;
+		else{
+			//Searching for the deadline index in array d
+			for(j=0;j<jobs;j++){
+				if(d[j]==i){
+					final_dead[i] = p[j]; //Store the profits in the final deadline list
+					profit += p[j];
+					break;
+				}
+			}
+		}
+	}
+	printf("\nMaximum Profit = %d\n", profit);
+	
+}
+
+int main(){
+	printf("Enter number of jobs: ");
+	scanf("%d", &jobs);
+	input();
+	jobSelection();
+	return 0;
+}