From 247089decc980b44bed38093c599d79c64c87e78 Mon Sep 17 00:00:00 2001
From: Sayan Bandyopadhyay <sayan.bandyopadhyay@yahoo.co.in>
Date: Thu, 12 Oct 2017 03:28:43 +0530
Subject: [PATCH] Update minimum_partition.py

The loop for finding differences had issues of float being iterated. Has been fixed.
---
 dynamic_programming/minimum_partition.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/dynamic_programming/minimum_partition.py b/dynamic_programming/minimum_partition.py
index 25b7621e1..18aa1faa2 100644
--- a/dynamic_programming/minimum_partition.py
+++ b/dynamic_programming/minimum_partition.py
@@ -20,7 +20,7 @@ def findMin(arr):
             if (arr[i-1] <= j):
                 dp[i][j] = dp[i][j] or dp[i-1][j-arr[i-1]]
 
-    for j in range(s/2, -1, -1):
+    for j in range(int(s/2), -1, -1):
         if dp[n][j] == True:
             diff = s-2*j
             break;