Optimize Your Schedule: Activity Selection Using Greedy Approach in C

Discover how to efficiently select the maximum number of non-overlapping activities using the Greedy Algorithm in C.

The Activity Selection Problem is a fundamental problem in combinatorial optimization where the goal is to select the maximum number of activities that don’t overlap, given their start and finish times. In this blog, we will delve into solving this problem using a greedy algorithm in C, complete with a comprehensive explanation and code example.

Implementing the Activity Selection Problem Using a Greedy Approach in C

The greedy approach involves always selecting the next activity that finishes the earliest and is compatible with the previously selected activity. Here’s a complete C program to demonstrate this:

#include<stdio.h>

int st[50], fin[50], c = 0;

void main() {
    int i, j, n;
    printf("Greedy Approach: Activity Selection >>\n\n");
    printf("Enter Number of Activities: ");
    scanf("%d", &n);

    printf("\nEnter Activity Start time and Finish time Respectively:\n");
    for(i = 0; i < n; i++) {
        printf("\nStart time for Activity %d: ", 1 + i);
        scanf("%d", &st[i]);
        printf("Finish time for Activity %d: ", 1 + i);
        scanf("%d", &fin[i]);
    }

    printf("\nSelected Activities are: ");
    i = 0;
    printf("\n- A%d with %d Start time and %d Finish time", 1, st[0], fin[0]);
    for (j = 1; j < n; j++) {
        if (st[j] >= fin[i]) {
            printf("\n- A%d with %d Start time and %d Finish time", j + 1, st[j], fin[j]);
            i = j;
            c++;
        }
    }

    printf("\n\nTotal Number of Activities Selected: %d\n", c + 1); // +1 to include the first activity
}

Explanation:

1. Variable Initialization:
— `st` and `fin` arrays store the start and finish times of the activities, respectively.
— `c` keeps track of the count of selected activities.

2. Main Function:
— Takes user input for the number of activities and their respective start and finish times.
— Initializes the selection process by always picking the first activity.
— Iterates through the list of activities, selecting each activity that starts after or when the last selected activity finishes.
— Updates the count of selected activities (`c`) and prints each selected activity’s details.

Conclusion

The greedy approach to the Activity Selection Problem provides an efficient and straightforward way to maximize the number of non-overlapping activities you can attend. This C implementation highlights how a simple algorithm can solve complex scheduling problems effectively. By understanding and applying this algorithm, you can improve your ability to tackle similar optimization challenges in various domains. Happy coding

Comments

Post a Comment

Popular posts from this blog

Vue.js

Image
  Introduction to Vue.js Vue  is a  progressive framework  for building user interfaces. Unlike other monolithic frameworks, Vue is designed from the ground up to be incrementally adoptable.  The core library is focused on the view layer only and is easy to pick up and integrate with other libraries or existing projects.  On the other hand, Vue is also perfectly capable of powering sophisticated Single-Page Applications when used in combination with  modern tooling  and  supporting libraries . What is the best fit for Vue.js? As there are so so many Js Framework are there let me clear up what is the best fit for Vue.js Considering all the conceptual and technical aspects of Vue.js, you might question where it might fit the best. Besides its direct purpose, building one-page applications and working on web pages, it’s also suitable for a number of tasks. Dealing with prototypes (without too much skill) First and foremost, Vue.js was designed f...
Read more
Image
Fibonacci Series in C: Iterative vs Recursive Methods Learn how to compute the Fibonacci series in C using both iterative loops and recursive functions. When it comes to computing the Fibonacci series, there are various approaches to achieve the desired sequence. In this blog, we’ll explore two primary methods: iterative and recursive. Both have their unique advantages and can be utilized based on the specific requirements of your program. Let’s delve into the code and understand each method in detail. Iterative Fibonacci in C The iterative approach to calculating Fibonacci numbers uses loops and conditional statements. This method is straightforward and efficient in terms of both time and space complexity. Here’s a sample code snippet for the iterative method: # include <stdio.h> int main () { int n1 = 0 , n2 = 1 , n3, i, number, c = 0 ; printf ( "Fibonacci Series: Iterative" ); printf ( "\n\nEnter the number of elements: " ); scanf ( "%d...
Read more
Image
Unlocking Insertion Sort: A Practical Guide to Efficient Sorting with Dart Master the fundamentals of Insertion Sort with this detailed guide and Dart code examples, ideal for beginners and enthusiasts. Sorting algorithms are essential tools in a programmer’s toolkit, and Insertion Sort is a simple yet powerful method for sorting small datasets. In this blog, we’ll explore the mechanics of Insertion Sort, implement it in Dart, and highlight its key features and use cases. How Insertion Sort Works Insertion Sort is a comparison-based algorithm that builds the final sorted array one item at a time. It’s much like sorting a hand of playing cards: you pick each card and insert it into its correct position among the previously sorted cards. Here’s a step-by-step breakdown of Insertion Sort: Start from the second element: Assume the first element is already sorted. Pick the next element: Compare it with the elements in the sorted part of the array. Shift elements: Move all elements that are ...
Read more