Efficiency of algorithms for programming beginners

  • Authors:
  • David Ginat

  • Affiliations:
  • Science Teaching Department, Weizmann Institute of Science, Rehovot, Israel

  • Venue:
  • SIGCSE '96 Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

Introductory computer science courses often present the concept of algorithm efficiency in a rather late stage, through searching and sorting problems. We believe that the concept of efficiency can be presented much earlier. In this paper we present a novel approach in which efficiency of algorithms is presented early, gradually and intuitively. We link our approach to cognitive consequences of programming instruction and illustrate it with three problems.We implemented our approach with 10th and 11th grade high-school students. In the paper, we describe our experience with posing the three problems to the students. Student solutions varied considerably, reflecting different levels of insight into the problems. The various solutions led to fruitful class discussions, thus widening the students' repertoire of templates, and enhancing student realization as to the importance of analysis and planning.