Design and Analysis of Algorithms
activity-selection
greedy-algorithm
daa
design-and-analysis-of-algorithms
activity-selection-problem
optimization
greedy-method
algorithms
non-overlapping-activities
scheduling
Activity Selection Problem in DAA
Activity Selection Problem ek Greedy Algorithm based problem hai jisme maximum number of non-overlapping activities select ki jaati hain. Isme activities ko earliest finish time ke according select kiya jaata hai.