mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-06 05:39:30 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update minimum_partition.py

Browse Source 
The loop for finding differences had issues of float being iterated. Has been fixed.
This commit is contained in:
Sayan Bandyopadhyay 2017-10-12 03:28:43 +05:30 committed by GitHub
parent f9156cfb71
commit 247089decc
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
dynamic_programming/minimum_partition.py
View File

@ -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;