The purpose of this chapter is to provide an introduction to some of the methods commonly used to search or sort data. On completing the chapter, the student should understand and be able to use the following:
General:
No new data types are taken up in chapter 13.
General:
searching and sorting algorithms and their performance, simple sorts and advanced sorts
Realized in the Modula-2 notation:
linear and binary searches, bubble sort, insert sort, selection sort, Shell sort, comb sort, quicksort, and merge sort
General:
No new programming abstractions are taken up in this chapter; but the ability to analyze the performance of loops is important to this material.
Realized in the Modula-2 notation: