Advanced search
Publication Cover
A I I E Transactions Volume 8, 1976 - Issue 2
Journal homepage
17
Views
0
CrossRef citations to date
0
Altmetric
TECHNICAL NOTE

Long Division: An Example of When the Greedy Algorithm Solves a Knapsack Problem

Michael J. Magazine University of Waterloo, Waterloo, Ontario, Canada
&
Henry L. W. Nuttle North Carolina State University, Raleigh, North Carolina, 27607
Pages 283-285 | Received 01 Aug 1975, Published online: 09 Jul 2007
 
Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.