// #include "stdafx.h"
    #include <string>
    #include <iostream>
    #include <algorithm>
    #include <vector>
    #include <list>
    #include <utility>
    #include <map>
    using namespace std;
    
    // begin():   Returns a random-access iterator to the first element in the container.
    
    // end(): Returns a random-access iterator that point just beyond the end of the vector.
    
    // rbegin() Returns an iterator to the first element in a reversed vector.
    
    // rend() Returns an iterator to the end of a reversed vector.
    
    // back():   Returns a reference to the last element of the vector.
    
    // front() Returns a reference to the first element in a vector.
    
    // pop_back() Deletes the element at the end of the vector.
    
    // push_back() Add an element to the end of the vector.
    
    // clear(): Erases the elements of the vector.
    
    // empty(): Tests if the vector container is empty.
    
    // erase() Removes an element or a range of elements in a vector from specified positions.
    
    // insert() Inserts an element or a number of elements into the vector at a specified position.
    
    // size() Returns the number of elements in the vector.
    
    // max_size() Returns the maximum length of the vector.
    
    // resize() Specifies a new size for a vector.
    
    // capacity():  Returns the number of elements that the vector could contain without allocating more storage.
    
    // reserve() Reserves a minimum length of storage for a vector object.
    
    // assign():  Erases a vector and copies the specified elements to the empty vector.
    
    // at():      Returns a reference to the element at a specified location in the vector.
    
    int main()
    {
        // Vectors
    	vector<double> hw;
            double *y;
    
    	double x;
    	while(cin >> x)
    	{//Reads values till ctrl d
    		hw.push_back(x);
    	}
    
            cout << "Elements read in were: " << endl;
            for(int i=0; i<hw.size(); i++)
               cout << hw[i] << " " << endl;
            cout << endl;
    
    	vector<int>::size_type size = hw.size();
    	if(size == 0)
    	{
    		cout << "The size must not be Zero" << endl;
    		return 1;
    	}
            cout << "The number of elements is: " << size << endl;
            cout << endl;
    
    	sort(hw.begin(), hw.end());
    
            cout << "Sorted list: " << endl;
            for(int i=0; i<hw.size(); i++)
               cout << hw[i] << " " << endl;
            cout << endl;
    
    	vector<int>::size_type mid = size / 2;
    
    	double median = (size % 2 == 0) ? (hw[mid] + hw[mid+1]) / 2 : hw[mid];
    
    	cout << "The median is " << median << endl;
    
            random_shuffle(hw.begin(), hw.end());
            cout << "Random Shuffled list: " << endl;
            for(int i=0; i<hw.size(); i++)
             cout << hw[i] << " " << endl;
            cout << endl;

          random_shuffle(hw.begin(), hw.end());
            cout << "Random Shuffled list: " << endl;
            for(int i=0; i<hw.size(); i++)
             cout << hw[i] << " " << endl;
            cout << endl;

    
            cout << "The size of the list is: " << hw.size() << endl;
            cout << endl;
    
            hw.insert(hw.end()-2,hw.begin()+1,hw.end()-1);
            cout << "Inserting into the list " << endl;
            cout << "The size of the list is: " << hw.size() << endl;
            cout << endl;
            cout << "New list is " << endl;
            for(int i=0; i<hw.size(); i++)
             cout << hw[i] << " " << endl;
            cout << endl;
    
    
            hw.clear();
            cout << "Size of the list after clearing it is: " << hw.size() << endl;
            cout << endl;  
            cout << "Printing an empty list " << endl;
            for(int i=0; i<hw.size(); i++)
             cout << hw[i] << " " << endl;
    
            hw.push_back(20);  // push_back() means append
            hw.push_back(30);  // push_back() means append
            hw.push_back(6);  // push_back() means append
           cout << "List with 3 element has size" << hw.size() << endl;
           cout << "Elements are " << endl;
            for(int i=0; i<hw.size(); i++)
             cout << hw[i] << " " << endl;
           hw.erase(hw.begin()+1);
           cout << "List with 2 element has size" << hw.size() << endl;
           cout << "Elements are " << endl;
            for(int i=0; i<hw.size(); i++)
             cout << hw[i] << " " << endl;

    
           cout << "Elements are when using an iterator " << endl;
           vector<double>::iterator itr;
           for ( itr = hw.begin(); itr != hw.end(); ++itr )
               cout << *itr << endl;
            cout << endl;
    
    }