Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

• Divide-and-conquer (Section 11.1.1)
• Prune-and-search, also known as decrease-and-conquer (Section 11.7.1)
• Brute force (Section 12.2.1)
• The greedy method (Section 12.4.2)
• Dynamic programming (Section 12.5.2).
Likewise, some of the software engineering design patterns we discuss include:
• Position (Section 6.2.2)
• Adapter (Section 6.1.2)
• Iterator (Section 6.3)
• Template method (Sections 7.3.7, 11.6, and 13.3.2)
• Composition (Section 8.1.2)
• Comparator (Section 8.1.2)
• Decorator (Section 13.3.1).
Rather than explain each of these concepts here, however, we introduce them
throughout the text as noted above. For each pattern, be it for algorithm engineering
or software engineering, we explain its general use and we illustrate it with at least
one concrete example.
2.2 Inheritance and Polymorphism
To take advantage of hierarchical relationships, which are common in software
projects, the object-oriented design approach provides ways of reusing code.
2.2.1 Inheritance
The object-oriented paradigm provides a modular and hierarchical organizing
structure for reusing code, through a technique called inheritance. This technique
allows the design of general classes that can be specialized to more particular
classes, with the specialized classes reusing the code from the general class. The
general class, which is also known as a base class or superclass, can define
standard instance variables and methods that apply in a multitude of situations. A
class that specializes, or extends, or inherits from, a superclass need not give new
implementations for the general methods, for it inherits them. It should only define
those methods that are specialized for this particular subclass.
96