#include <vector>
#include <algorithm>
#include <iostream>
int main()
{
int num_to_find = 169;
std::vector<int> v;
for (int i = 0; i < 20; i++)
{
v.push_back(i);
std::cout << v[i] << ' ';
}
std::endl;
std::vector<int>::iterator iter;
iter = std::find( v.begin(), v.end(), num_to_find );
if(iter == v.end())
std::cout << "not found" << std::endl;
else
std::cout << iter - v.begin() << std::endl;
}
#include <vector>
#include <algorithm>
#include <iostream>
int isprime(int n)
{
for(int i = 2; i <= n / 2; i++)
return n % i == 0;
}
int main()
{
std::vector<int> v(20);
for(int i = 0; i < v.size(); i++)
{
v[i] = (i + 1) * (i + 3);
std::cout << v[i] << ' ';
}
std::cout << std::endl;
std::vector<int>::iterator iter;
iter = std::find_if(v.begin(), v.end(), isprime);
if (iter != v.end())
std::cout << "found:" << *iter
<< std::endl << "the first index is " << iter - v.begin() << std::endl;
}