continuous knapsack problem (also known as the fractional knapsack problem)
continuous knapsack is a problem in computer science in which the goal is to fill a container (the "knapsack") with fractional amounts of different materials chosen to maximize the value of the selected materials.
This Application is an illustration of the greedy algorithm which is used to solve this problem.It is implemented by JavaFX and its input could be random or customize by user. Then the order of choosing items will be shown by animation.
Here is a screenshot of the application:
