该程序用贪心算法来求解0-1背包问题 采用贪婪准则:每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p/w largest goods Add backpack.
本程序允许用户使用不同的XML,选择在左面显示的样式页,右面的数据-This demo allows the user to surf through different XML documents and apply different XSL
stylesheets to those documents. Choose an XML document and a XSL stylesheet on the left and display
the data on the right.