111 {
112
113 std::uint16_t N1 = 4;
114 std::vector<std::uint16_t> wt1 = {1, 3, 4, 5};
115 std::vector<std::uint16_t> val1 = {6, 1, 7, 7};
116 std::uint16_t W1 = 8;
117
119 N1, W1, val1, wt1) == 48);
120 std::cout << "Maximum Knapsack value "
122 N1, W1, val1, wt1)
123 << std::endl;
124
125
126 std::uint16_t N2 = 3;
127 std::vector<std::uint16_t> wt2 = {10, 20, 30};
128 std::vector<std::uint16_t> val2 = {60, 100, 120};
129 std::uint16_t W2 = 5;
130
132 N2, W2, val2, wt2) == 0);
133 std::cout << "Maximum Knapsack value "
135 N2, W2, val2, wt2)
136 << std::endl;
137
138
139 std::uint16_t N3 = 3;
140 std::vector<std::uint16_t> wt3 = {2, 4, 6};
141 std::vector<std::uint16_t> val3 = {5, 11, 13};
142 std::uint16_t W3 = 27;
143
145 N3, W3, val3, wt3) == 27);
146 std::cout << "Maximum Knapsack value "
148 N3, W3, val3, wt3)
149 << std::endl;
150
151
152 std::uint16_t N4 = 0;
153 std::vector<std::uint16_t> wt4 = {};
154 std::vector<std::uint16_t> val4 = {};
155 std::uint16_t W4 = 10;
157 N4, W4, val4, wt4) == 0);
158 std::cout << "Maximum Knapsack value for empty arrays: "
160 N4, W4, val4, wt4)
161 << std::endl;
162
163 std::cout << "All test cases passed!" << std::endl;
164}
std::uint16_t unboundedKnapsack(std::uint16_t N, std::uint16_t W, const std::vector< std::uint16_t > &val, const std::vector< std::uint16_t > &wt)
Wrapper function to initiate the unbounded knapsack calculation.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4