#include <iostream>
#include <algorithm>

using namespace std ;



int main()
{

      vector<int> numbers = {10, 20, 30, 40, 50};
      //Linear search example

      // Value to search for
      int searchValue1 = 30;
      int searchValue2 = 60;

      // Use find to search for searchValue1
      vector<int>::iterator it1 = find(numbers.begin(), numbers.end(), searchValue1);

      // Check if the element was found
      if ( it1 != numbers.end())
      {
          cout << "Element " << searchValue1 << " found at position: "
                    << distance(numbers.begin(), it1) << endl;
      }
      else
      {
          cout << "Element " << searchValue1 << " not found." << endl;
      }

      it1 = find(numbers.begin(), numbers.end(), searchValue2 );

      // Check if the element was found
      if ( it1 != numbers.end())
      {
          cout << "Element " << searchValue2 << " found at position: "
                    << distance(numbers.begin(), it1) << endl;
      }
      else
      {
          cout << "Element " << searchValue2 << " not found." << endl;
      }

     if (binary_search(numbers.begin(), numbers.end(), searchValue1))
     {
        cout << "Binary search: " << searchValue1 << " found in the vector." << endl;
     } else {
        cout << "Binary search: " << searchValue1 << " not found in the vector." << endl;
      }

    return 0 ;
}