Chapter Five

Reading: Chapter 5

This chapter contains an introductory study of algorithms—a topic that was introduced as being the core of computer science in Chapter 0. It begins with a formal definition of an algorithm and a discussion of the meaning of that definition. This leads to a discussion of algorithm creation (a creative process that parallels the more generic task of problem solving) and algorithm representation (the process of expressing an algorithm in preparation for, or during, programming).

The search for algorithm development techniques is presented as an ongoing activity—not a settled issue. The chapter discusses some of the ideas proposed by researchers in the field of problem solving and relates these ideas to the problem of algorithm discovery and representation. This chapter also introduces iterative structures by means of the sequential search and insertion sort algorithms as well as recursive structures by means of the binary search algorithm. In each case, emphasis is placed on the components involved in controlling the repetitive process.

The chapter also introduces the subjects of algorithm efficiency (using big theta notation) and correctness.