//	CS212 CS II Assignment 4
//	Due: Mon. March 7, 2011
//	
//	File Name: assignment4_list.cpp
//	Author: Abby Jamgochian
//	Instructor: Dr. Wang
//
//	Compile: g++ assignment4_list.cpp
//	Run:	./a.out
//
//	Goal: The program will prompt the user with a question as what the 
//		user wants to do. It will help the user put together a 
//		string.
//
#include <iostream>
using namespace std;

const int MAX = 500;

class List
{
	string data[MAX];
	int length;
public:
	List()	{ 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_R()
	{	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;
		}
	}
	void SelectionSort()
	{
		string temp;
		int passCount, 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 Menu()
	{	char op;
		cout << "	List Operations\n";
		cout << "============================================\n";
		cout << "I	Insert an item.\n";
		cout << "F	Find out if the item is in the list.\n";
		cout << "S	Sort the list in ascending order.\n";
		cout << "R	Sort the list in descending order.\n";
		cout <<	"D	Display the string list.\n";
		cout << "Q	Quit the operation.\n";
		cout << "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n";
		cout << "Your option is: ";
		cin >> op;
	}
};

int main()
{
	List real;
	char op;
	string item;

	cout << "	List Operations\n";
	cout << "=================================================\n";
	cout << "I	Insert an Item.\n";
	cout << "F	Find out if the item is in the list.\n";
	cout << "S	Sort the list to ascending order.\n";
	cout << "R	Sort the list to descending order.\n";
	cout << "D	Display the string list.\n";
	cout << "Q	Quit the operation.\n";
	cout << "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n";
	cout << "Your option is: ";
	cin >> op;

	while(toupper(op) != 'Q')
	{
		if(toupper(op) == 'I')
		{	cout << "Input the item: ";
			cin >> item;
			real.Insert(item);
			cout << "The current list is - ";
			real.Print();
		}
		else if(toupper(op) == 'F')
		{	cout << "Input an item to be found: ";
			cin >> item;
			if(real.IsPresent(item))
				cout << item << " is in the list.\n";
			else
				cout << item << " is not in the list.\n";
		}
		else if(toupper(op) == 'S')
		{	real.SelectionSort();
			cout << "The list is - ";
			real.Print();
		}
		else if(toupper(op) == 'R')
		{	real.SelectionSort_R();
			cout << "The list is - ";
			real.Print();
		}		
		else if(toupper(op) == 'D')
		{	cout << "The list is - ";
			real.Print();
		}


                cout << "       List Operations\n";
                cout << "========================================\n";
        cout << "I      Insert an Item.\n";
        cout << "F      Find out if the item is in the list.\n";
        cout << "S      Sort the list to ascending order.\n";
        cout << "R      Sort the list to descending order.\n";
        cout << "D      Display the string list.\n";
        cout << "Q      Quit the operation.\n";
                cout << "~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n";
                cout << "Your option is: ";
                cin >> op;
	}

	return 0;
}