Learn More
This paper is a report and discussion of a basic course in computer science offered at Brigham Young University for the last several years. A motivational approach is taken in the course -- beginning at a very low level and developing the basic problems that arose historically. Students are requested to solve several of these problems as programming(More)
The information-gathering aspect of sorting is considered from a theoretical viewpoint. A large class, <italic>R,</italic> of sorting algorithms is defined, based on the idea of information use. Properties of this algorithm class are developed, and it is noted that several well-known sorting algorithms are closely related to algorithms in(More)
  • 1