Modified Dosctrings

Author: OmkarPathak

pygorithm/dynamic_programming/binary_knapsack.py

@@ -3,11 +3,16 @@
 Created At: 25th August 2017
 """
 import inspect
-# TODO: Explain how this works / Explain what a knapsack is
 
 
 def knapsack(w, value, weight):
     """
+    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 value: an array of values of items in the knapsack
     :param weight: an array of weights of items in the knapsack

pygorithm/dynamic_programming/lis.py

@@ -8,9 +8,10 @@ def longest_increasing_subsequence(_list):
     """
     The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a
     given sequence such that all elements of the subsequence are sorted in increasing order. For example,
-    the length of LIS for {10, 22, 9, 33, 21, 50, 41, 60, 80} is 6 and LIS is {10, 22, 33, 50, 60, 80}.
-    :param _list:
-    :return:
+    the length of LIS for [10, 22, 9, 33, 21, 50, 41, 60, 80] is 6 and LIS is [10, 22, 33, 50, 60, 80].
+
+    :param _list: an array of elements
+    :return: returns a tuple of maximum length of lis and an array of the elements of lis
     """
     # Initialize list with some value
     lis = [1] * len(_list)