COMPARATIVE ANALYSIS OF THE GREEDY METHOD AND DYNAMIC PROGRAMMING IN SOLVING THE KNAPSACK PROBLEM

Authors

  • Oluyinka I. Omotosho, Aderemi E. Okeyinka Author

Keywords:

Greedy algorithm, Dynamic Programming, Comlexity, Knapsack model

Abstract

In this work, two of the existing algorithms for solving the Knapsack are investigated and implemented using the same programming language. The complexity of the programs and hence the algorithms were measured to determine the more efficient of the two algorithm. The result of this comparative study of complexity is that Greedy algorithm is more efficient for solving knapsack problem than dynamic programming approach

Downloads

Published

2015-08-14

Issue

Section

Articles

How to Cite

COMPARATIVE ANALYSIS OF THE GREEDY METHOD AND DYNAMIC PROGRAMMING IN SOLVING THE KNAPSACK PROBLEM. (2015). Global Journal of Advanced Engineering Technologies and Sciences, 2(8), 62-72. https://gjaets.com/index.php/gjaets/article/view/283

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 9 10 > >>