Trouver la première position d’insertion d’élément dans la collection

Author:


Download


#include 
using std::cout;
using std::endl;

#include 
#include 
#include 

int main()
{
   int tab[ 10 ] = { 1, 2, 3, 4, 4, 6, 6, 6, 6, 8 };
   std::vector< int > v( tab, tab + 10 );
   std::ostream_iterator< int > output( cout, " " );

   std::copy( v.begin(), v.end(), output );

   std::vector< int >::iterator lb;
   lb = std::lower_bound( v.begin(), v.end(), 6 );
   cout <<"La première position d'insertion de 6 est entre"
	    << *( lb - 1 ) <<" et "
		<<*lb <
    

Leave a Reply

Your email address will not be published. Required fields are marked *