diff options
| author | Sven Eisenhauer <sven@sven-eisenhauer.net> | 2023-11-10 15:11:48 +0100 |
|---|---|---|
| committer | Sven Eisenhauer <sven@sven-eisenhauer.net> | 2023-11-10 15:11:48 +0100 |
| commit | 33613a85afc4b1481367fbe92a17ee59c240250b (patch) | |
| tree | 670b842326116b376b505ec2263878912fca97e2 /Bachelor/Prog2/Codebeispiele/7_ch21/fig21_33.CPP | |
| download | Studium-33613a85afc4b1481367fbe92a17ee59c240250b.tar.gz Studium-33613a85afc4b1481367fbe92a17ee59c240250b.tar.bz2 | |
Diffstat (limited to 'Bachelor/Prog2/Codebeispiele/7_ch21/fig21_33.CPP')
| -rw-r--r-- | Bachelor/Prog2/Codebeispiele/7_ch21/fig21_33.CPP | 79 |
1 files changed, 79 insertions, 0 deletions
diff --git a/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_33.CPP b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_33.CPP new file mode 100644 index 0000000..f489c5e --- /dev/null +++ b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_33.CPP @@ -0,0 +1,79 @@ +// Fig. 21.33: fig21_33.cpp
+// Standard library functions copy_backward, merge,
+// unique and reverse.
+#include <iostream>
+
+using std::cout;
+using std::endl;
+
+#include <algorithm> // algorithm definitions
+#include <vector> // vector class-template definition
+
+int main()
+{
+ const int SIZE = 5;
+ int a1[ SIZE ] = { 1, 3, 5, 7, 9 };
+ int a2[ SIZE ] = { 2, 4, 5, 7, 9 };
+
+ std::vector< int > v1( a1, a1 + SIZE );
+ std::vector< int > v2( a2, a2 + SIZE );
+
+ std::ostream_iterator< int > output( cout, " " );
+
+ cout << "Vector v1 contains: ";
+ std::copy( v1.begin(), v1.end(), output );
+ cout << "\nVector v2 contains: ";
+ std::copy( v2.begin(), v2.end(), output );
+
+ std::vector< int > results( v1.size() );
+
+ // place elements of v1 into results in reverse order
+ std::copy_backward( v1.begin(), v1.end(), results.end() );
+
+ cout << "\n\nAfter copy_backward, results contains: ";
+ std::copy( results.begin(), results.end(), output );
+
+ std::vector< int > results2( v1.size() + v2.size() );
+
+ // merge elements of v1 and v2 into results2 in sorted order
+ std::merge( v1.begin(), v1.end(), v2.begin(), v2.end(),
+ results2.begin() );
+
+ cout << "\n\nAfter merge of v1 and v2 results2 contains:\n";
+ std::copy( results2.begin(), results2.end(), output );
+
+ // eliminate duplicate values from results2
+ std::vector< int >::iterator endLocation;
+ endLocation =
+ std::unique( results2.begin(), results2.end() );
+
+ cout << "\n\nAfter unique results2 contains:\n";
+ std::copy( results2.begin(), endLocation, output );
+
+ cout << "\n\nVector v1 after reverse: ";
+
+ // reverse elements of v1
+ std::reverse( v1.begin(), v1.end() );
+
+ std::copy( v1.begin(), v1.end(), output );
+
+ cout << 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. *
+ *************************************************************************/
\ No newline at end of file |