Modified Dosctrings

Author: OmkarPathak

pygorithm/greedy_algorithm/activity_selection.py

@@ -3,11 +3,16 @@
 Created On: 26th August 2017
 """
 import inspect
-# TODO: Explain what this is / how it works
 
 
 def activity_selection(start_times, finish_times):
     """
+    The activity selection problem is a combinatorial optimization problem concerning the selection of
+    non-conflicting activities to perform within a given time frame, given a set of activities each marked
+    by a start time (si) and finish time (fi). The problem is to select the maximum number of activities
+    that can be performed by a single person or machine, assuming that a person can only work on a single
+    activity at a time.
+
     :param start_times: An array that contains start time of all activities
     :param finish_times: An array that conatins finish time of all activities
     """

pygorithm/greedy_algorithm/fractional_knapsack.py

@@ -3,11 +3,16 @@
 Created On: 22nd August 2017
 """
 import inspect
-# TODO: Explain how this works / Explain what a knapsack is
 
 
 def knapsack(w, item_values, item_weights):
     """
+    The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of
+    items, each with a weight and a value, determine the number of each item to include in a collection so
+    that the total weight is less than or equal to a given limit and the total value is as large as
+    possible. It derives its name from the problem faced by someone who is constrained by a fixed-size
+    knapsack and must fill it with the most valuable items.
+
     :param w: maximum weight capacity
     :param item_values: a list of values of items in the knapsack
     :param item_weights: a list of weights of items in the knapsack