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_31.CPP | |
| download | Studium-master.tar.gz Studium-master.tar.bz2 | |
Diffstat (limited to 'Bachelor/Prog2/Codebeispiele/7_ch21/fig21_31.CPP')
| -rw-r--r-- | Bachelor/Prog2/Codebeispiele/7_ch21/fig21_31.CPP | 97 |
1 files changed, 97 insertions, 0 deletions
diff --git a/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_31.CPP b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_31.CPP new file mode 100644 index 0000000..97720e4 --- /dev/null +++ b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_31.CPP @@ -0,0 +1,97 @@ +// Fig. 21.31: fig21_31.cpp
+// Standard library search and sort algorithms.
+#include <iostream>
+
+using std::cout;
+using std::endl;
+
+#include <algorithm> // algorithm definitions
+#include <vector> // vector class-template definition
+
+bool greater10( int value ); // prototype
+
+int main()
+{
+ const int SIZE = 10;
+ int a[ SIZE ] = { 10, 2, 17, 5, 16, 8, 13, 11, 20, 7 };
+
+ std::vector< int > v( a, a + SIZE );
+ std::ostream_iterator< int > output( cout, " " );
+
+ cout << "Vector v contains: ";
+ std::copy( v.begin(), v.end(), output );
+
+ // locate first occurrence of 16 in v
+ std::vector< int >::iterator location;
+ location = std::find( v.begin(), v.end(), 16 );
+
+ if ( location != v.end() )
+ cout << "\n\nFound 16 at location "
+ << ( location - v.begin() );
+ else
+ cout << "\n\n16 not found";
+
+ // locate first occurrence of 100 in v
+ location = std::find( v.begin(), v.end(), 100 );
+
+ if ( location != v.end() )
+ cout << "\nFound 100 at location "
+ << ( location - v.begin() );
+ else
+ cout << "\n100 not found";
+
+ // locate first occurrence of value greater than 10 in v
+ location = std::find_if( v.begin(), v.end(), greater10 );
+
+ if ( location != v.end() )
+ cout << "\n\nThe first value greater than 10 is "
+ << *location << "\nfound at location "
+ << ( location - v.begin() );
+ else
+ cout << "\n\nNo values greater than 10 were found";
+
+ // sort elements of v
+ std::sort( v.begin(), v.end() );
+
+ cout << "\n\nVector v after sort: ";
+ std::copy( v.begin(), v.end(), output );
+
+ // use binary_search to locate 13 in v
+ if ( std::binary_search( v.begin(), v.end(), 13 ) )
+ cout << "\n\n13 was found in v";
+ else
+ cout << "\n\n13 was not found in v";
+
+ // use binary_search to locate 100 in v
+ if ( std::binary_search( v.begin(), v.end(), 100 ) )
+ cout << "\n100 was found in v";
+ else
+ cout << "\n100 was not found in v";
+
+ cout << endl;
+
+ return 0;
+
+} // end main
+
+// determine whether argument is greater than 10
+bool greater10( int value )
+{
+ return value > 10;
+
+} // end function greater10
+
+/**************************************************************************
+ * (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 |