Buenos Aires. Argentina.

In this paper we describe a methodology for constructing efficient algorithms applied in an elementary course on Data Structures and Algorithms. This methodology attempts to show the essential steps in a sequential process in software development from an informally stated problem, via a formal problem specification, to a final efficient program. Students of the course are expected to have at least a year's experience in programming high level languages and elementary logic and calculus. We describe a prototype, AyDA, which assists in the construction of algorithms starting from the proposed methodology