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

using namespace std;

class Vector
{
	string data;
	int length;
public: 
	public:
        Vector()  { length = 0;   }
        int Length() const
        {       return length;  }
        void Insert(string item)
        {       data[length] = item;
                length ++;
        }
        void Print() const
        {       for(int i=0; i<length; i++)
                        cout << data[i] << " ";
                cout << "\n";
        }
        bool IsPresent(string item) const
        {       bool found = false;
                for(int i=0; i<length && !found; i++)
                        if(data[i] == item) found = true;
                return found;
        }
        void SelectionSort()    
        {       string temp;
                int passCount;
                int minIndex;
                for(passCount=0; passCount<length-1; passCount ++)
                {       minIndex = passCount;
                        for(int k=passCount+1; k<length; k++)
                        {       if( data[minIndex] < data[k]) minIndex = k; }
                        temp = data[minIndex];
                        data[minIndex] = data[passCount];
                        data[passCount] = temp;
                }
        }
        void SelectionSort_B()
        {       string temp;
                int passCount;
                int maxIndex;
                for(passCount=0; passCount<length-1; passCount++)
                {       maxIndex = passCount;
                        for(int k=passCount+1; k<length; k++)
                        {       if(data[maxIndex] > data[k]) maxIndex = k; }
                        temp = data[maxIndex];
                        data[maxIndex] = data[passCount];
                        data[passCount] = temp;
                }
        }



int main()
{
	vector <int> v;

	v.push_back(12);	// 12
	v.push_back(7);		// 12, 7
	v.push_back(33);	// 12, 7, 33

	cout << "The list is: ";
	for(int i=0; i<v.size(); i++)
		cout << v[i] << " ";
	cout << "\n\n";


	// 'V' - reverse the order
	reverse(v.begin(), v.end() );
	cout << "After reversing the order the list is: ";
        for(int i=0; i<v.size(); i++)
                cout << v[i] << " ";
        cout << "\n\n";

	// 's' - sort to ascending order
	sort(v.begin(), v.end());
	cout << "After sorting the list is: ";
        for(int i=0; i<v.size(); i++)
                cout << v[i] << " ";
        cout << "\n\n";
	
	//'d' - sort to descending order
	sort(v.begin(), v.end(), greater<int>());
	 cout << "After descending order the list is: ";
        for(int i=0; i<v.size(); i++)
                cout << v[i] << " ";
        cout << "\n\n";	

	// 'r' remove - use pop_back

	// 'f' - search for an item
	bool found = false;
	int item;
	cout << "Input the item to be found -";	
	cin >> item;

	for(int i=0; i<v.size() && !found; i++)
	{
		if (item == v[i])
			found = true;
	}
	if (found)	cout << "\n\n" << item << " is in the list.\n\n";
	else		cout << "\n\n" << item << " is not in the 
list.\n\n";

	return 0;

}