Design patterns for sorting
作者： Dung “Zung” Nguyen , Stephen B. Wong
关键词:
摘要: Drawing on Merritt's divide-and-conquer sorting taxonomy [1], we model comparison-based as an abstract class with a template method to perform the sort by relegating splitting and joining of arrays its concrete subclasses. Comparison objects is carried out via ordering strategy. This reduces code complexity simplifies analyses various algorithms. Performance measurements visualizations can be added without modifying any utilizing decorator design pattern. object-oriented not only provides student way unifying seemingly disparate algorithms but also help him/her differentiate them at proper level abstraction.
acm.org
rice.edu 参考文章(3)
Koen Langendoen, Kees van Reeuwijk, Henri E. Bal, Ceriel J.H. Jacobs, Dick Grune, Modern Compiler Design ,(2000)
Richard Helm, John Vlissides, Ralph Johnson, Erich Gamma, Design Patterns: Elements of Reusable Object-Oriented Software ,(1994)
Susan M. Merritt, An inverted taxonomy of sorting algorithms Communications of the ACM. ,vol. 28, pp. 96- 99 ,(1985) , 10.1145/2465.214925