Three different implementations of solving the knapsack problem: Dynamic, brute force and greedy.
Package details |
|
---|---|
Author | Simon Jonsson, Fanny Karelius |
Maintainer | Simon Jonsson <simjo241@liu.se>, Fanny Karelius <fanka309@liu.se> |
License | GPL-3 |
Version | 0.1.0 |
Package repository | View on GitHub |
Installation |
Install the latest version of this package by entering the following in R:
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.