//
//	using the vector class template
//		for int list
//	pg. 147 - 148
//

#include <iostream>
#include <vector>
using namespace std;

int main()
{
	vector <int> v;

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

	// 'P'
	cout << "The list is: ";
	for(int i=0; i<v.size(); i++)	// or use i<3 since 3 #s
		cout << v[i] << " ";
	cout << "\n\n";

	// 'V' - reverse the order
	//reverse(v.begin(), v.end() );

	// 'S' - sort to ascending order
	//sort(v.begin(), v.end() );	
	
	// 'D' - sort to descending order
	//sort(v.begin(), v.end(), greater<int>() );

        // 'P'
        cout << "The list is: ";
        for(int i=0; i<v.size(); i++)   // or use i<3 since 3 #s
                cout << v[i] << " ";
        cout << "\n\n";

	// 'F' - search for 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 << " isn't in the list.\n\n";

	return 0;
}