Long Division: An Example of When the Greedy Algorithm Solves a Knapsack Problem |
| |
| Authors: | Michael J. Magazine Henry L. W. Nuttle |
| |
| Affiliation: | a University of Waterloo, Waterloo, Ontario, Canadab North Carolina State University, Raleigh, North Carolina |
| |
| Abstract: | ![]()
The familiar long division procedure is recast as an application of the greedy algorithm for a Knapsack Problem. In this light it can be seen to yield the desired quotient by employing the smallest possible number of subtractions. |
| |
| Keywords: | |
| 本文献已被 InformaWorld 等数据库收录！ |
|
