// List ADT implementation

#include <iostream>

using namespace std;

const int MAX = 100;

class List
{	int length;
	int data[MAX];	// assuming: integer list
public:
	List()	// empty: length=0
	{	length = 0;   }
	int Length() const
	{	return length;      }
	bool IsEmpty() const
	{	return length == 0;   }
	bool IsFull() const
	{	return length == MAX; }
	void Insert(int item) 
	{	data[length] = item; length++;	}
	bool IsPresent (int item) const;
	void SelSort();   
	void Print() const
	{	for(int i=0; i<length; i++)
			cout << data[i] << " ";
		cout << endl;
	}
};

bool List :: IsPresent (int item) const
{
	bool done = false;
	for(int i=0; i<length&&!done; i++)
		if(item == data[i])
			done = true;
	return done;
}

void List :: SelSort()
{
	int 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;
	}
}


int main()
{	int item;
	// Q: declare a List obj. list1?
	List list1;
	// Q: prompt, input, and insert items to list1?
	cout << "Input an integer? ";
	cin >> item;
	while(cin)
	{	list1.Insert(item);
		cout << "Input an integer? ";
        	cin >> item;
	}
	
	// check the length?
	 cout << "\n\n*************\nLength: " << list1.Length() << endl; // 4
	// Q: out the list to the screen?
	cout << "The list is: ";
	list1.Print();
	
	// sort list to ascending order.
	list1.SelSort();
	cout << "\n\nThe sorted list is: ";
        list1.Print();

	
	//debug
	cout << "\n\nBye.\n\n";
	return 0;
}