programminga general overview design class templatecollectionthat stores collection of objects (in an array)along with the current size of the collection provide public functions isemptymakeemptyinsertremoveand contains contains(xreturns true if and only if an object that is equal to is present in the collection design class templateorderedcollectionthat stores collection of comparables (in an array)along with the current size of the collection provide public functions isemptymakeemptyinsertremovefindminand findmax findmin and findmax return references to the smallest and largestrespectivelycomparable in the collection explain what can be done if these operations are performed on an empty collection define rectangle class that provides getlength and getwidth using the findmax routines in figure write main that creates an array of rectangle and finds the largest rectangle first on the basis of area and then on the basis of perimeter for the matrix classadd resize member function and zero-parameter constructor references there are many good textbooks covering the mathematics reviewed in this small subset is [ ][ ][ ][ ][ ]and [ reference [ is specifically geared toward the analysis of algorithms it is the first volume of three-volume series that will be cited throughout this text more advanced material is covered in [ throughout this bookwe will assume knowledge of +for the most part[ describes the final draft standard of ++ andbeing written by the original designer of ++remains the most authoritative another standard reference is [ advanced topics in +are discussed in [ the two-part series [ gives great discussion of the many pitfalls in +the standard template librarywhich we will investigate throughout this textis described in [ the material in sections is meant to serve as an overview of the features that we will use in this text we also assume familiarity with pointers and recursion (the recursion summary in this is meant to be quick reviewwe will attempt to provide hints on their use where appropriate throughout the textbook readers not familiar with these should consult [ or any good intermediate programming textbook general programming style is discussed in several books some of the classics are [ ][ ]and [ albertson and hutchinsondiscrete mathematics with algorithmsjohn wiley sonsnew york bavelmath companion for computer sciencereston publishing co restonva brualdiintroductory combinatorics th ed pearsonbostonmass dijkstraa discipline of programmingprentice hallenglewood cliffsn eckelthinking in ++ ed prentice hallenglewood cliffsn grahamd knuthand patashnikconcrete mathematicsaddison-wesleyreadingmass griesthe science of programmingspringer-verlagnew york