alg2.cpp
#include ‹iostream.h›
#include ‹stl.h›
int i[] = {1, 4, 2, 8, 2, 2};
int main() {
int n = 0; // Must be initialized, as count increments n.
count(i, i + 6, 2, n);
cout ‹‹ 'Count of 2s = ' ‹‹ n ‹‹ endl;
return 0;
}
gener1.cpp
#include ‹stl.h›
#include ‹iostream.h›
#include ‹stdlib.h›
int main() {
int numbers[10];
generate(numbers, numbers + 10, rand);
for (int i = 0; i ‹ 10; i++) cout ‹‹ numbers[i] ‹‹ ' ';
cout ‹‹ endl;
return 0;
}
replace0.cpp
#include ‹stl.h›
#include ‹iostream.h›
int numbers[6] = {0, 1, 2, 0, 1, 2};
int main() {
replace(numbers, numbers + 6, 2, 42);
for (int i = 0; i ‹ 6; i++) cout ‹‹ numbers[i] ‹‹ ' ';
cout ‹‹ endl;
return 0;
}
rndshuf0.cpp
#include ‹stl.h›
#include ‹iostream.h›
int numbers[6] = {1, 2, 3, 4, 5, 6};
int main() {
random_shuffle(numbers, numbers + 6);
for (int i = 0; i ‹ 6; i++) cout ‹‹ numbers[i] ‹‹ ' ';
cout ‹‹ endl;
return 0;
}
bind1st2.cpp
#include ‹iostream.h›
#include ‹stl.h›
int array[3] = {1, 2, 3};
int main() {
int* p = remove_if(array, array + 3, bind1st(less‹int›(), 2));
for (int* i = array; i != p; i++) cout ‹‹ *i ‹‹ endl;
return 0;
}
unique1.cpp
#include ‹stl.h›
#include ‹iostream.h›
int numbers[8] = {0, 1, 1, 2, 2, 2, 3, 4};
int main() {
unique(numbers, numbers + 8);
for (int i = 0; i ‹ 8; i ++) cout ‹‹ numbers[i] ‹‹ ' ';
cout ‹‹ endl;
return 0;
}
bind2nd2.cpp