#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>

using namespace std;

void vector_out(vector<double> v)
{
  copy(v.begin(),v.end(), // from
       ostream_iterator<double>(cout," ")); // to 
  cout<<endl;
}

int main()
{
  vector<double> v;
  vector<double>::iterator it;

  v.push_back(1.4);
  v.push_back(1.6);
  v.push_back(0.2);
  v.push_back(1.8);
  v.push_back(0.1);
  v.push_back(1.5);
  cout<<"original vector"<<endl;
  vector_out(v);
    
  it = min_element(v.begin(),v.end());
  cout<<"minimum element = "<<*it<<endl; 
  it = max_element(v.begin(),v.end());
  cout<<"maximum element = "<<*it<<endl; 
  
  //find element with some value 
  it = find(v.begin(),v.end(),0.2); 
  if(it==v.end()) 
    cout<<"failed to find value"<<endl;
  else {
    cout<<"found value "<<*it<<endl;  
    // reverse some elements
    cout<<"reverse starting from "<<*it<<endl;
    reverse(it,v.end());
    vector_out(v);
  }
  cout<<"sorting..."<<endl;
  sort(v.begin(),v.end());
  vector_out(v); 
  return 0;
}