OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update dynamic_programming/partition_problem.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Lajat5 2021-11-09 23:09:49 +05:30 committed by GitHub
parent 519390b1b8
commit d830017be3
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
dynamic_programming/partition_problem.cpp
View File

@ -4,12 +4,12 @@
*Problem](https://en.wikipedia.org/wiki/Partition_problem )
* @details
* The partition problem, or number partitioning, is the task of deciding
*whether a given multiset S of positive integers can be partitioned into two
*subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the
*numbers in S2. Although the partition problem is NP-complete, there is a
*pseudo-polynomial time dynamic programming solution, and there are heuristics
*that solve the problem in many instances, either optimally or approximately.
*For this reason, it has been called "the easiest hard problem".
* whether a given multiset S of positive integers can be partitioned into two
* subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the
* numbers in S2. Although the partition problem is NP-complete, there is a
* pseudo-polynomial time dynamic programming solution, and there are heuristics
* that solve the problem in many instances, either optimally or approximately.
* For this reason, it has been called "the easiest hard problem".
*
* The worst case time complexity of Jarvis’s Algorithm is O(n^2). Using
* Graham’s scan algorithm, we can find Convex Hull in O(nLogn) time.