From c78167b357a32b11d22bb7bb124dc326ccca63e3 Mon Sep 17 00:00:00 2001 From: Lajat5 <64376519+Lazeeez@users.noreply.github.com> Date: Wed, 10 Nov 2021 07:42:21 +0530 Subject: [PATCH] Update dynamic_programming/partition_problem.cpp Co-authored-by: David Leal --- dynamic_programming/partition_problem.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/dynamic_programming/partition_problem.cpp b/dynamic_programming/partition_problem.cpp index 2562d4e3a..1f4aef2dd 100644 --- a/dynamic_programming/partition_problem.cpp +++ b/dynamic_programming/partition_problem.cpp @@ -6,7 +6,7 @@ * 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 + * 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".