Generic find algorithm: use find function to find an element in an array : find « STL Algorithms Non modifying sequence operations « C++






Generic find algorithm: use find function to find an element in an array

  
 
#include <iostream>
#include <cassert>
#include <algorithm>
#include <list>
#include <iterator>
using namespace std;

int main()
{
  int a[10] = {12, 3, 25, 7, 11, 213, 7, 123, 29, -31};

  // Find the first element equal to 7 in the array:
  int* ptr = find(&a[0], &a[10], 7);

  assert (*ptr == 7 && *(ptr+1) == 11);

  cout << *ptr;

  return 0;
}

/* 
7
 */        
    
  








Related examples in the same category

1.Use find to search an element in a container
2.find an element in a list
3.Find the maximum element in a range in a list
4.Locate first occurrence of a value in a vector
5.Using find with normal iteration
6.Demonstrating generic find algorithm with an array
7.Use find algorithm to find an element in a list
8.Use istream_iterator and find
9.Generic find algorithm with input iterators associated with io streams
10.Use assert to check the find method
11.find and display v in lowest 20th percentile
12.find and display v in highest 20th percentile
13.find and display sorted v in lowest 20th percentile
14.find and display sorted v in highest 20th percentile