For many sorting applications, the keys that define the order are strings. In this section from Algorithms, Part II, the authors look at methods that take advantage of special properties of strings to develop sorts for string keys that are more efficient than general-purpose sorts.
The authors of Algorithms, Part I describe a complete programming model using the Java programming language.
This chapter provides perspective on various approaches to studying algorithms, places the field of study into context among related fields, and sets the stage for the rest of the book. To this end, the authors illustrate concepts within a fundamental and representative problem domain: the study of sorting algorithms.
The application of the deductive method to your programs assures that your system’s software components will work together and behave as they must. In this chapter, the authors discuss transformations and their orbits.