Demonstrating the generic find algorithm with a vector : vector find « Vector « C++






Demonstrating the generic find algorithm with a vector

  
 

#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>  // For find
using namespace std;


int main()
{
  char x[5] = {'a', 'b', 'c', 'd', 'f'};

  vector<char> vector1(&x[0], &x[5]);

  // Search for the first occurrence
  vector<char>::iterator where = find(vector1.begin(), vector1.end(), 'b');


  cout << *where  << endl;
  return 0;
}

/* 
b

 */        
    
  








Related examples in the same category

1.Locate maximum element in a vector
2.Locate minimum element in a vector
3.Find the min value in the vector
4.Find the max value in the vector
5.Find the first pair of matching consecutive elements
6.Find the first of two values
7.Find the first subsequence
8.Find the last subsequence (which should be the same as the first)
9.Find the first subsequence of two consecutive 8s
10.Binary search a vector
11.Search the vector for the elements present in the list
12.Returns the positions of all values within a range