PHPackages                             writ3it/libalgo-knapsack-problem - PHPackages - PHPackages  [Skip to content](#main-content)[PHPackages](/)[Directory](/)[Categories](/categories)[Trending](/trending)[Leaderboard](/leaderboard)[Changelog](/changelog)[Analyze](/analyze)[Collections](/collections)[Log in](/login)[Sign up](/register)

1. [Directory](/)
2. /
3. writ3it/libalgo-knapsack-problem

ActiveLibrary

writ3it/libalgo-knapsack-problem
================================

Solution for Knapsack problem in PHP applications.

v0.1.1(3y ago)213[1 issues](https://github.com/writ3it/libalgo-knapsack-problem/issues)1MITPHPPHP &gt;=7.2

Since Jul 9Pushed 3y ago1 watchersCompare

[ Source](https://github.com/writ3it/libalgo-knapsack-problem)[ Packagist](https://packagist.org/packages/writ3it/libalgo-knapsack-problem)[ RSS](/packages/writ3it-libalgo-knapsack-problem/feed)WikiDiscussions master Synced 1mo ago

READMEChangelog (2)Dependencies (3)Versions (3)Used By (1)

libalgo-knapsack-problem
========================

[](#libalgo-knapsack-problem)

Solution for Knapsack problem in PHP applications.

[See description of the problem.](https://en.wikipedia.org/wiki/Knapsack_problem)

Available algorithms
--------------------

[](#available-algorithms)

ClassnameAlgorithm nameComputational complexitySpace complexityDynamicKnapsackSolverSolves Knapsack problem using dynamic programming.`O(n*W)` where *n* means number of Items and *W* means Bag capacity.`O(n*W)` where *n* means number of Items and *W* means Bag capacity.Example of use
--------------

[](#example-of-use)

```
