Đang chuẩn bị liên kết để tải về tài liệu:
Absolute C++ (4th Edition) part 69

Absolute C++ (4th Edition) part 69. KEY BENEFIT: C++ programming concepts and techniques are presented in a straightforward style using understandable language and code. KEY TOPICS: C++ Basics; Flow of Control; Function Basics; Parameters and Overloading; Arrays; Structures and Classes; Constructors; Operator Overloading, Friends, and References; Strings; Pointers and Dynamic Arrays; Separate Compilation and Namespaces; Streams and File I/O; Recursion; Inheritance; Polymorphism and Virtual Functions; Templates; Linked Data Structures; Exception Handling; Standard Template Library; Patterns and UML. MARKET: Useful for both beginning and intermediate C++ programmers. . | Answers to Self-Test Exercises 687 9. Since the type can be any type at all there are no natural candidates for the default initialization values. So this constructor does nothing but it does allow you to declare uninitialized objects without giving any constructor arguments. template class T Pair T Pair Do nothing. 10. int addUp const Pair int thePair return thePair.getFirst thePair.getSecond 11. template class T T addUp const Pair T thePair return thePair.getFirst thePair.getSecond 12. You add the following to the public section of the template class definition of PFArray friend void showData PFArray T theObject Displays the data in theObject to the screen. Assumes that is defined for values of type T. You also need to add a function template definition of showData. One possible definition is as follows namespace PFArraySavitch template class T void showData PFArray T theObject for int i 0 i theObject.used i cout theObject i endl PFArraySavitch 13. Yes it is perfectly legal. There are other possibly preferable ways to accomplish the same thing but this is legal and not even crazy. 14. template class T TwoDimPFArrayBak T TwoDimPFArrayBak PFArray PFArray T 688 Templates Programming Projects 1. Write a template version of the iterative binary search from Display 13.8. Specify requirements on the template parameter type. Discuss the requirements on the template parameter type. 2. Write a template version of the recursive binary search from Display 13.6. Specify requirements on the template parameter type. Discuss the requirements on the template parameter type. 3. The template sort routine Display 16.3 is based on an algorithm called the selection sort Another related sorting algorithm is called insertion sort. The insertion sort algorithm is the sort method used to sort a Bridge hand. Consider each element in turn inserting it into its proper place among the elements at the start of the array that are already sorted. The element being considered is inserted by .