C++ SAMPLE CODE 16b

 #include<iostream>

#include<algorithm>

#include<vector>

using namespace std;

int main()

{

   vector<int> V;

   int S[9] = {15, 20, 30, 40, 50, 60, 70, 80, 90};

   for(int i =0; i < 9; i++)

   V.push_back (S[i]);

   int m = 5;

   fill_n (V.begin(), V.size()/3 , m );

   for (int k =0; k<V.size(); k++)

      cout << V[k] << " ";

   cout<<"\n";

   int n = 10;

   fill ( V.begin(), V.end(), n );

   for (int j =0; j<V.size(); j++)

      cout << V[j] <<" ";

   cout<<"\n";

   return 0 ; 

}

===================================

#include<iostream>

#include<algorithm>

#include<vector>

using namespace std;

int main()

{ 

   vector<int> V;

   int S[7] = { 10,20, 24 ,30, 35, 36, 70};

   for(int i =0; i < 7 ;i++)

      V.push_back (S[i]);

   int n = 24;

   vector <int> ::iterator iter;

   iter = find(V.begin(), V.end(), n);

   if (iter != V.end())

      cout <<"Nilai "<<n<<" adalah sebuah elemen dari vektor V."<<endl;

   else

      cout<<"Nilai "<< n<<"bukan elemen dari vektor V.\n";

   return 0 ;

}

==================================

#include<iostream>

#include<algorithm>

#include<vector>

using namespace std;

int main()

{ 

   vector<int> V;

   int S[12] = {10, 20, 25, 26, 27, 36, 20, 25, 26, 27, 70, 90};

   for(int i =0; i < 12 ;i++)

      V.push_back (S[i]);

   int Runtun1_Ditemukan[] = {20, 25,26,27};

   vector<int>:: iterator iter;

   iter = find_end( V.begin(), V.end(), Runtun1_Ditemukan, Runtun1_Ditemukan + 3);

   if ( iter != V.end())

      cout<<"Elemen terakhir pada Runtun1_Ditemukan pada posisi "<< *iter <<endl;

   else

      cout<<"Tidak ada Runtun1_Ditemukan di dalam vektor V."<<endl;

   int Runtun2_Ditemukan[] = {20, 4,26 };

   iter = find_end( V.begin(), V.end(), Runtun2_Ditemukan, Runtun2_Ditemukan + 2);

   if ( iter != V.end())

      cout<<"Elemen terakhir pada Runtun2_Ditemukan pada posisi "<< *iter <<endl;

   else

      cout<<"Tidak ada Runtun2_Ditemukan di dalam vektor V."<<endl;

   return 0 ;

}

==============================

#include<iostream>

#include<algorithm>

using namespace std;

int main()

{

   int *Cari;

   int S[9] = {1, 6, 2, 3, 4, 5, 6, 7, 8};

   int S2[] = {5, 6, 7};

   Cari = find_first_of(S, S+9, S2, S2+3);

   if(Cari != S+9) //jika tidak ada kesesuaian, pointer menunjuk ke akhir runtun

      cout<<"Ditemukan kecocokan: "<< *Cari<<endl;

   return 0 ;

}

==============================

#include<iostream>

#include<algorithm>

#include<functional>

using namespace std;

int main()

{

   int S[] = {5, 6, 3, 7, 8, 3, 8, 10, 8, 12};

   int* n = find_if(S, S+10, bind2nd(greater<int>(),7));

   cout<<"*n = "<< *n<<endl;

   cout <<"Posisi dari elemen = elemen ke-"<<n + 1 - S<<endl;

   return 0;

}

===========================

#include<iostream>

#include<algorithm>

#include<functional>

using namespace std;

void Kali(int &x)

{

cout<<10*x<<" ";

}

int main()

{ 

   int S1[] = {5, 6, 8, 7, 4, 3, 8, 10, 11, 12};

   for_each (S1, S1+10, Kali);

      cout<<"\n";

   return 0;

}

==============================

#include<iostream>

#include<algorithm>

using namespace std;

void Tampil(int x)

{

   cout<<x<<" ";

}

int main()

{ 

   int S[8] = { 0 };

   generate (S, S+8, rand);

   for ( int i =0; i<8; i++)

      Tampil(S[i]%100);

   cout<<"\n";

   int B [6] = {0};

   generate_n(B , 6, rand);

   for(int j =0; j<6; j++)

      Tampil(B[j]);

   cout<<"\n";

   

   return 0 ;

}

===================================

#include<iostream>

#include<algorithm>

using namespace std;

int main()

{ 

   int S[8] = { 5,6,7,8,9,11,12,13 };

   int A [9]= { 5,6,7,8, 21,22,23,24,25};

   bool B ;

   B = includes(S, S+8, A, A+4); //menguji apakah A sampai A+4 ada di dalam S

   if (B)

      cout <<"Runtun S memuat A[0] sampai A[3]"<< endl;

   else

      cout <<"Runtun S tidak memuat A[0] sampai A[3]"<< endl;

   return 0 ;

}

===================================

#include<iostream>

#include<numeric>

using namespace std;

int main()

{ 

   int S[7] = { 6,4,8,9,10,20,10};

   int A[7] = { 2,2,2,2,2,2,2};

   int n = 20;

   //Nilai dari n menginisialisasi inner_product.

   int hasilPerkalianDalam = inner_product(S ,S+7, A, n);

   cout<<"Hasil perkalian dalam dari elemen-elemen S dan A ditambah "<<n<<" = "

   <<hasilPerkalianDalam<<endl;

   return 0 ;

}

===========================

#include<iostream>

#include<algorithm>

using namespace std;

int main()

{

   int S[8] = {2, 4, 5, 1, 3, 6, 7, 9};

   int A[8] = {12, 13, 14, 15, 5, 6, 7, 24};

   inplace_merge(S, S+3, S+8);

   inplace_merge(A, A+4, A+8);

   for(int i =0; i<8; i++)

   cout << S[i] <<" ";

   cout<<"\n";

   for ( int j =0; j<8; j++)

      cout<< A [j] <<" ";

   cout<<"\n";

   return 0 ;

}