Rosetta Code

Knapsack problem/Continuous: Difference between revisions

Page Discussion

Knapsack problem/Continuous (view source)

Revision as of 20:47, 5 June 2013

29 bytes removed ,  11 years ago
Updated both D entries
(added →‎{{header|Racket}}: implementation)
(Updated both D entries)
Line 369:
{"sausage", 5.9, 98.0}];
 
// reverseReverse sorted by Value per amount.
const items = raw.sort!q{a.valuePerKG > b.valuePerKG}().release();
 
constimmutable(Item)[] chosen;
real space = 15.0;
foreach (item; items)
Line 385:
writefln("%10s %7s %7s %7s", "ITEM", "AMOUNT", "VALUE", "$/unit");
writefln("%(%s\n%)", chosen);
writeln(Item("TOTAL", chosen.sum!"amount"(chosen), chosen.sum!"value"(chosen))).writeln;
}</lang>
{{out}}
Line 395:
welt 3.50 63.38 18.11
TOTAL 15.00 349.38 23.29</pre>
 
===Alternative Version===
<lang d>importvoid std.stdio,main() std.algorithm;{
import std.stdio, std.algorithm;
 
void main() {
static struct T { string item; double weight, price; }
 
auto items = [T("beef", 3.8, 36.0),
T("pork", 5.4, 43.0),
Line 408 ⟶ 410:
T("welt", 3.7, 67.0),
T("salami", 3.0, 95.0),
T("sausage", 5.9, 98.0)];
sort .schwartzSort!q{ -a.price / a.weight > b.price/b.weight}(items);
 
auto left = 15.0;
foreach (it; items) {
if (it.weight <= left) {
writeln("Take all the ", it.item);
Line 418 ⟶ 420:
return;
left -= it.weight;
} else {
return writefln("Take %.1fkg %s", left, it.item);
return;
}
}
}</lang>
{{out}}
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/141092"