Design patterns for sorting

Nguyen, Dung; Wong, Simone

doi:10.1145/366413.364597

Cited by 10 publications

(10 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some studies [6,18] pointed at the gap between the ideas emphasized in OO programming and ideas taught in algorithms courses, especially due to the fact that most Data Structures and Algorithms texts use a procedural approach.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Has the paradigm shift in CS1 a harmful effect on data structures courses

Gal‐Ezer

Vilner

Zur

2009

Proceedings of the 40th ACM Technical Symposium on Computer Science Education

View full text Add to dashboard Cite

The ongoing debate among Computer Science educators about the advantages and disadvantages of the shift from the procedural to the Object-Oriented paradigm usually relates to the introductory course. Indeed, we were also concerned when in our institute we decided to implement this shift in our introductory course and started to teach Java, instead of a procedural paradigm. In our previous study we saw that the effect of the shift did not lower the achievements of students taking the CS1 course. Furthermore, we wanted to be equally sure that this was the case when students take Data Structures courses. This is the focus of the study presented in this paper. The results show that there is no significant difference in the achievements of students who came from different paradigm backgrounds. This encouraging result probably relates to the fact that our CS1 course focuses on the fundamentals of introductory Computer Science and does not only emphasize the language aspects.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Some researchers found that there is a serious conceptual and technical gap between ideas emphasized in OO programming and ideas taught in algorithms courses [18,6]. Object-Oriented programming encourages thinking about and organizing software around data.…”

Section: Background 11 Shifting To Object-oriented Programmingmentioning

confidence: 99%

Has the paradigm shift in CS1 a harmful effect on data structures courses

Gal‐Ezer

Vilner

Zur

2009

Proceedings of the 40th ACM Technical Symposium on Computer Science Education

View full text Add to dashboard Cite

show abstract

“…It is interesting to compare the sorting-machine interface to the abstract class for sorting presented in [5]. By our understanding, the latter conforms to P2, could be considered to conform to P1 (although we suspect this was not intended), and does not conform to P3 through P5.…”

Section: "2: Hide Algorithms Used To Implement Operationsmentioning

confidence: 99%

Algorithms and object-oriented programming

et al. 2002

View full text Add to dashboard Cite

Currently there is a serious conceptual and technical gap between ideas emphasized in object-oriented programming and ideas as taught in algorithms courses. We suggest both a paradigm for "re-expressing" algorithms in terms of classes and objects, and a set of criteria relative to which the quality of such re-expressions can be evaluated. A detailed example is provided for re-expressing the algorithmic idea of sorting.

show abstract

“…As far as Data Structures goes, there have been important accomplishments in using both Abstract Data Structures [13,14,19], and patterns for typical problems such as sorting [15,16]. There are various textbooks [5,19] that go beyond data structures into algorithm analysis, but fail to treat the algorithms taking into account OO hierarchies and inheritance.…”

Section: Related Workmentioning

confidence: 99%

Object-oriented algorithm analysis and design with Java

Rajsbaum

Viso

2005

Science of Computer Programming

View full text Add to dashboard Cite

This paper presents a new approach to algorithm design and analysis that benefits from the OO characteristics of Java. It consists of first defining the inheritance structure of a collection of algorithms, at different levels of abstraction. Then, correctness proofs and complexity measures are designed for the various levels of abstraction. The goal is to prove as many properties as possible at each abstract level, assuming the implementations of the methods called upon will be correct. Thus, when a more specialized algorithm is derived from a more abstract one, proofs and complexity analysis can be reused, and simply need to be completed by proving that the properties assumed for the concrete methods indeed hold. The approach is illustrated with several inheritance trees: for sorting, graph algorithms, string matching, and network flow. Each tree, at the bottom of the hierarchy, yields well-known algorithms in the respective area. Instead of using pseudo-code to describe these trees, Java is used to make the process more precise and useful, encouraging the design and analysis of algorithms, and also experimentation with new variants. The implementation presented in this paper takes advantage of Java's organization to build the inheritance trees for the classes, and Java's interfaces, collections, comparators, and iterators.

show abstract

Design patterns for sorting

Cited by 10 publications

References 1 publication

Has the paradigm shift in CS1 a harmful effect on data structures courses

Has the paradigm shift in CS1 a harmful effect on data structures courses

Algorithms and object-oriented programming

Object-oriented algorithm analysis and design with Java

Contact Info

Product

Resources

About