Demonstrate count_if().


#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool isEven(int i) 
{
  return !(i%2);
}

int main()
{
  vector<int> vectorObject;
  int i;

  for(i =1; i < 20; i++) 
     vectorObject.push_back(i);

  cout << "Sequence:\n";
  for(i = 0; i <vectorObject.size(); i++)
    cout << vectorObject[i] << " ";
  cout << endl;

  i = count_if(vectorObject.begin(), vectorObject.end(), isEven);
  cout << i << " numbers are evenly divisible by 2.\n";

  return 0;
}

Related examples in the same category

1.	Perform an in-place merge for two vectors
2.	Using Other Search functions
3.	Matching Elements Using the equals and mismatch Operations
4.	Creating and Resizing Vectors
5.	Demonstrate count and count_if.
6.	Demonstrate remove_copy in Vector
7.	Access a vector using an iterator.
8.	Demonstrate insert and erase.
9.	Store a class object in a vector.
10.	Demonstrate allocator's max_size() fucntion in vector
11.	Demonstrate count() in vector
12.	Demonstrate reverse in vector
13.	Demonstrate insert_iterator in vector
14.	Demonstrate adjacent_difference() in vector
15.	Demonstrate inner_product() in vector
16.	Demonstrate partial_sum() in Vector
17.	Storing Class Objects with overloaded operators in a Vector
18.	Vector Init Array
19.	Use istream_iterator with the copy algorithm
20.	Demonstrate remove_copy and replace_copy.
21.	Vector: Insert Erase Sort
22.	Demonstrate accumulate() in vector
23.	end() in vector
24.	Use pop_back() and empty().
25.	Access the elements of a vector through an iterator.
26.	The basic operation of a vector: size, push_back,
27.	Accessing a Vector Through an Iterator
28.	Use istream_iterator to read various data types
29.	Create permutations based on vector
30.	Work with heaps: make_heap from vector
31.	Demonstrating the four ways that vectors can be created.
32.	Vector Capacity vs size
33.	Using clear()

Demonstrate count_if(). : Vector « Data Structure « C++

Related examples in the same category