1 files changed, 96 insertions, 0 deletions
diff --git a/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_36.CPP b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_36.CPP
new file mode 100644
index 0000000..b742eec
--- /dev/null
+++ b/Bachelor/Prog2/Codebeispiele/7_ch21/fig21_36.CPP
@@ -0,0 +1,96 @@
+// Fig. 21.36: fig21_36.cpp
+// Standard library functions lower_bound, upper_bound and 
+// equal_range for a sorted sequence of values.
+#include <iostream>
+
+using std::cout;
+using std::endl;
+
+#include <algorithm>  // algorithm definitions
+#include <vector>     // vector class-template definition
+
+int main()
+{
+   const int SIZE = 10;
+   int a1[] = { 2, 2, 4, 4, 4, 6, 6, 6, 6, 8 };
+   std::vector< int > v( a1, a1 + SIZE );
+   std::ostream_iterator< int > output( cout, " " );
+
+   cout << "Vector v contains:\n";
+   std::copy( v.begin(), v.end(), output );
+
+   // determine lower-bound insertion point for 6 in v
+   std::vector< int >::iterator lower;
+   lower = std::lower_bound( v.begin(), v.end(), 6 );
+   
+   cout << "\n\nLower bound of 6 is element " 
+        << ( lower - v.begin() ) << " of vector v";
+
+   // determine upper-bound insertion point for 6 in v
+   std::vector< int >::iterator upper;
+   upper = std::upper_bound( v.begin(), v.end(), 6 );
+
+   cout << "\nUpper bound of 6 is element " 
+        << ( upper - v.begin() ) << " of vector v";
+
+   // use equal_range to determine both the lower- and 
+   // upper-bound insertion points for 6
+   std::pair< std::vector< int >::iterator, 
+              std::vector< int >::iterator > eq;
+   eq = std::equal_range( v.begin(), v.end(), 6 );
+
+   cout << "\nUsing equal_range:\n"
+        << "   Lower bound of 6 is element "
+        << ( eq.first - v.begin() ) << " of vector v";
+   cout << "\n   Upper bound of 6 is element "
+        << ( eq.second - v.begin() ) << " of vector v";
+
+   cout << "\n\nUse lower_bound to locate the first point\n"
+        << "at which 5 can be inserted in order";
+
+   // determine lower-bound insertion point for 5 in v
+   lower = std::lower_bound( v.begin(), v.end(), 5 );
+
+   cout << "\n   Lower bound of 5 is element " 
+        << ( lower - v.begin() ) << " of vector v";
+
+   cout << "\n\nUse upper_bound to locate the last point\n"
+        << "at which 7 can be inserted in order";
+
+   // determine upper-bound insertion point for 7 in v
+   upper = std::upper_bound( v.begin(), v.end(), 7 );
+
+   cout << "\n   Upper bound of 7 is element " 
+        << ( upper - v.begin() ) << " of vector v";
+
+   cout << "\n\nUse equal_range to locate the first and\n"
+        << "last point at which 5 can be inserted in order";
+
+   // use equal_range to determine both the lower- and 
+   // upper-bound insertion points for 5
+   eq = std::equal_range( v.begin(), v.end(), 5 );
+
+   cout << "\n   Lower bound of 5 is element "
+        << ( eq.first - v.begin() ) << " of vector v";
+   cout << "\n   Upper bound of 5 is element "
+        << ( eq.second - v.begin() ) << " of vector v" 
+        << 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