algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-07 17:56:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update Minimum sum partition

Browse Source 
Added some test cases for better understanding.
This commit is contained in:
Swati Prajapati
2020-06-03 15:19:55 +05:30
committed by GitHub
parent b1caf8c6ae
commit 5d771745ac
1 changed files with 14 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
DynamicProgramming/Minimum sum partition
View File

@ -1,5 +1,19 @@
// Partition a set into two subsets such that the difference of subset sums is minimum // Partition a set into two subsets such that the difference of subset sums is minimum
/*
Input: arr[] = {1, 6, 11, 5}
Output: 1
Explanation:
Subset1 = {1, 5, 6}, sum of Subset1 = 12
Subset2 = {11}, sum of Subset2 = 11
Input: arr[] = {36, 7, 46, 40}
Output: 23
Explanation:
Subset1 = {7, 46} ; sum of Subset1 = 53
Subset2 = {36, 40} ; sum of Subset2 = 76
*/
import java.util.*; import java.util.*;
import java.lang.*; import java.lang.*;
import java.io.*; import java.io.*;