52_컨테이너와 find

#include <iostream>
#include <algorithm> //STL 알고리즘 함수
#include <vector>  //vector 컨테이너 h
using namespace std;
#include <time.h>
#include "BitArrayList.h"

template <typename T1, typename T2>
T1 myfind(T1 begin, T1 end, T2 value)
{
 while (begin != end && *begin != value)
  begin++;
 return begin;
}

int main()
{
 vector<int> vec; //컨테이너
 vec.push_back(10);
 vec.push_back(20);

 vector<int>::iterator it;
 it = find(vec.begin(), vec.end(), 20);
 if (it == vec.end())
  cout << "못찾았다.." << endl;
 else
  cout << "찾았다." << *it << endl;  
 return 0;
}