'Virtual' experimentation on algorithm optimality

摘要

Learning programming in general, and algorithms in particular, demands to carry out a variety of practical activities, including experiments. In this paper, we summarize our instructional experience experimenting with algorithm optimality and we discuss the main issues raised. First, we introduce experimentation with algorithms. Afterwards, we briefly present the tools we developed for experimentation with optimality (GreedEx, GreedExCol and OptimEx) and we illustrate the kind of results that are expected by using a number of (exact and nonexact) greedy algorithms. We also describe our experiences in actual courses. Of special relevance are the students' difficulties and misconceptions we identified, as well as the interventions we performed to remove them. Finally, we relate these experiences with a number of relevant educational issues, namely learning goals, instructional methods, and how to address students' difficulties.