blob: 907c83e7b256e6ba15182d94123dd6a04ecd5fb3 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
// Fig. 21.38: fig21_38.cpp
// Standard library algorithms min and max.
#include <iostream>
using std::cout;
using std::endl;
#include <algorithm>
int main()
{
cout << "The minimum of 12 and 7 is: "
<< std::min( 12, 7 );
cout << "\nThe maximum of 12 and 7 is: "
<< std::max( 12, 7 );
cout << "\nThe minimum of 'G' and 'Z' is: "
<< std::min( 'G', 'Z' );
cout << "\nThe maximum of 'G' and 'Z' is: "
<< std::max( 'G', 'Z' ) << endl;
return 0;
} // end main
/**************************************************************************
* (C) Copyright 1992-2003 by Deitel & Associates, Inc. and Prentice *
* Hall. All Rights Reserved. *
* *
* DISCLAIMER: The authors and publisher of this book have used their *
* best efforts in preparing the book. These efforts include the *
* development, research, and testing of the theories and programs *
* to determine their effectiveness. The authors and publisher make *
* no warranty of any kind, expressed or implied, with regard to these *
* programs or to the documentation contained in these books. The authors *
* and publisher shall not be liable in any event for incidental or *
* consequential damages in connection with, or arising out of, the *
* furnishing, performance, or use of these programs. *
*************************************************************************/
|
