activitySelection.js

@@ -1,12 +1,19 @@
+// The 
 activity
 Sele
@@ -12,17 +12,869 @@
 vity
-Selection.js
+ selection problem is a combinatorial optimization problem concerning the selection of non-conflicting activities%0A// to perform within a given time frame, given a set of activities each marked by a start time (si) and finish time (fi).%0A// The problem is to select the maximum number of activities that can be performed by a single person or machine,%0A// assuming that a person can only work on a single activity at a time.%0A%0A// You are given n activities with their start and finish times.%0A// Select the maximum number of activities that can be performed by a single person,%0A// assuming that a person can only work on a single activity at a time.%0A%0A// Example:%0A%0A// Consider the following 6 activities.%0A//      start  =  %5B1, 3, 0, 5, 8, 5%5D;%0A//      finish =  %5B2, 4, 6, 7, 9, 9%5D;%0A%0A// The maximum set of activities that can be executed by a single person is %5B0, 1, 3, 4%5D
 %0A

add desc