Algorithms and object-oriented programming: bridging the gap

Authors:
Paolo Bucci;Wayne Heym;Timothy J. Long;Bruce W. Weide
Affiliations:
The Ohio State University, Columbus, Ohio;The Ohio State University, Columbus, Ohio;The Ohio State University, Columbus, Ohio;The Ohio State University, Columbus, Ohio
Venue:
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Year:
2002

Citing 8
Cited 3

Introduction to algorithms

Introduction to algorithms
Reuse of algorithms: still a challenge to object-oriented programming

Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Providing intellectual focus to CS1/CS2

SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Experience report: using RESOLVE/C++ for commercial software

SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
On the criteria to be used in decomposing systems into modules

Communications of the ACM
Do we really teach abstraction?

Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education
Design patterns for sorting

Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education
Recasting Algorithms to Encourage Reuse

IEEE Software

Optimal binary search trees meet object-oriented programming

Journal of Computing Sciences in Colleges
Components-first approaches to CS1/CS2: principles and practice

Proceedings of the 35th SIGCSE technical symposium on Computer science education
Has the paradigm shift in CS1 a harmful effect on data structures courses: a case study

Proceedings of the 40th ACM technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.