//
//	using the vector class template
//		for integer list
//

#include <iostream>
#include <vector>

using namespace std;

int main()
{
	vector <int> v;
	
	v.push_back(12);	// 12
	v.push_back(7);		// 7
	v.push_back(33);	// 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 << "The list after reverse 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 << "The ascencnding 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 << "The decending list is: " ;
        for(int i=0; i<v.size(); i++)
                cout << v[i] << " " ;
        
        cout << "\n\n";

	// 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;
}