尤金·卡拉汉 ， 罗伯特·墨菲， 阿纳斯·埃尔加法里
计算机科学的学生常常想知道，究竟什么时候可以对一个问题应用贪心算法，以及何时必须使用更复杂的、耗时的动态编程技术。本文认为，现有的教学文献并没有就这一问题提供明确的指导。我们建议通过导入经济学家在自己实现动态编程时使用的概念来改进计算机科学教育学。其经济概念是"机会成本"，我们将解释它如何帮助学生区分"贪心问题"和需要动态编程的问题。
Illustrating the Suitability of Greedy and Dynamic Algorithms Using The Economics Concept of "Opportunity Cost"
Eugene Callahan, Robert Murphy, Anas Elghafari
Students of Computer Science often wonder when, exactly, one can apply a greedy algorithm to a problem, and when one must use the more complicated and time-consuming techniques of dynamic programming. This paper argues that the existing pedagogical literature does not offer clear guidance on this issue. We suggest improving computer science pedagogy by importing a concept economists use in their own implementations of dynamic programming. That economic concept is "opportunity cost," and we explain how it can aid students in differentiating "greedy problems" from problems requiring dynamic programming.
