|
20 | 20 | namespace backtracking {
|
21 | 21 | /**
|
22 | 22 | * @namespace Subsets
|
23 |
| - * @brief Functions for the [Subset Sum](https://en.wikipedia.org/wiki/Subset_sum_problem) problem. |
| 23 | + * @brief Functions for the [Subset |
| 24 | + * Sum](https://en.wikipedia.org/wiki/Subset_sum_problem) problem. |
24 | 25 | */
|
25 | 26 | namespace subset_sum {
|
26 | 27 | /**
|
@@ -58,31 +59,41 @@ static void test() {
|
58 | 59 | // Test 1
|
59 | 60 | std::cout << "1st test ";
|
60 | 61 | std::vector<int> array1 = {-7, -3, -2, 5, 8}; // input array
|
61 |
| - assert(backtracking::subset_sum::subset_sum(0, array1) == 2); // first argument in subset_sum function is the required sum and second is the input array |
| 62 | + assert(backtracking::subset_sum::subset_sum(0, array1) == |
| 63 | + 2); // first argument in subset_sum function is the required sum and |
| 64 | + // second is the input array |
62 | 65 | std::cout << "passed" << std::endl;
|
63 | 66 |
|
64 | 67 | // Test 2
|
65 | 68 | std::cout << "2nd test ";
|
66 | 69 | std::vector<int> array2 = {1, 2, 3, 3};
|
67 |
| - assert(backtracking::subset_sum::subset_sum(6, array2) == 3); // here we are expecting 3 subsets which sum up to 6 i.e. {(1,2,3),(1,2,3),(3,3)} |
| 70 | + assert(backtracking::subset_sum::subset_sum(6, array2) == |
| 71 | + 3); // here we are expecting 3 subsets which sum up to 6 i.e. |
| 72 | + // {(1,2,3),(1,2,3),(3,3)} |
68 | 73 | std::cout << "passed" << std::endl;
|
69 | 74 |
|
70 | 75 | // Test 3
|
71 | 76 | std::cout << "3rd test ";
|
72 | 77 | std::vector<int> array3 = {1, 1, 1, 1};
|
73 |
| - assert(backtracking::subset_sum::subset_sum(1, array3) == 4); // here we are expecting 4 subsets which sum up to 1 i.e. {(1),(1),(1),(1)} |
| 78 | + assert(backtracking::subset_sum::subset_sum(1, array3) == |
| 79 | + 4); // here we are expecting 4 subsets which sum up to 1 i.e. |
| 80 | + // {(1),(1),(1),(1)} |
74 | 81 | std::cout << "passed" << std::endl;
|
75 | 82 |
|
76 | 83 | // Test 4
|
77 | 84 | std::cout << "4th test ";
|
78 | 85 | std::vector<int> array4 = {3, 3, 3, 3};
|
79 |
| - assert(backtracking::subset_sum::subset_sum(6, array4) == 6); // here we are expecting 6 subsets which sum up to 6 i.e. {(3,3),(3,3),(3,3),(3,3),(3,3),(3,3)} |
| 86 | + assert(backtracking::subset_sum::subset_sum(6, array4) == |
| 87 | + 6); // here we are expecting 6 subsets which sum up to 6 i.e. |
| 88 | + // {(3,3),(3,3),(3,3),(3,3),(3,3),(3,3)} |
80 | 89 | std::cout << "passed" << std::endl;
|
81 | 90 |
|
82 | 91 | // Test 5
|
83 | 92 | std::cout << "5th test ";
|
84 | 93 | std::vector<int> array5 = {};
|
85 |
| - assert(backtracking::subset_sum::subset_sum(6, array5) == 0); // here we are expecting 0 subsets which sum up to 6 i.e. we cannot select anything from an empty array |
| 94 | + assert(backtracking::subset_sum::subset_sum(6, array5) == |
| 95 | + 0); // here we are expecting 0 subsets which sum up to 6 i.e. we |
| 96 | + // cannot select anything from an empty array |
86 | 97 | std::cout << "passed" << std::endl;
|
87 | 98 | }
|
88 | 99 |
|
|
0 commit comments