A New Algorithm for Knapsack Problem

Knapsack proplem is essentially an integer programming problem,but it is a NPproblem in the view of computer algorithms.In this paper,an algorithm,whose complexityO(n)≤n.B,is presented for knapsack problem.Though its algorithm complexity is a pseudo-polynomial,its calculating efficiency is high when knapsack' capacity B is not very big.