Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-15T01:41:22.306Z Has data issue: false hasContentIssue false
  • English
  • Français

Functional Pearls: Unravelling greedy algorithms

Part of: JFP Research Articles

Published online by Cambridge University Press:  07 November 2008

Richard S. Bird
Richard S. Bird
Affiliation:
Programming Research Group, Oxford University, UK
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In my previous Functional Pearls article (Bird, 1992), I proved a theorem giving conditions under which an optimization problem could be implemented by a greedy algorithm. A greedy algorithm is one that picks a ‘best’ element at each stage. Here, we return to this theorem and extend it in various ways. We then use the theory to solve an intriguing problem about unravelling sequences into a smallest number of ascending subsequences.

Type
Articles
Information
Journal of Functional Programming , Volume 2 , Issue 3 , July 1992 , pp. 375 - 385
Copyright
Copyright © Cambridge University Press 1992

References

Bird, R. S. 1992. Two greedy algorithms. J. Functional Programming, 2 (1).CrossRefGoogle Scholar
Kaldewaij, A. 1985. On the decomposition of sequences into ascending subsequences. Infor. Processing Lett., 21, 69.CrossRefGoogle Scholar
Meertens, L. 1985. Some more examples of algorithmic developments. IFIP Wg2.1 Working Paper, Pont à Mousson, France.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.