// list ADT implementation

#include <iostream>

using namespace std;

const int MAX = 100;

class List
{	int length; 
	int data[MAX];
public: 
	List() //  empty: length = 0
	{	
		length = 0;	
	}
	int Length()
	{ 	
		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()
{
	List list1;
	int item;
	cout << "Please insert an item: ";
	cin >> item;

	while(cin)
	{
		list1.Insert(item);

		cout << "Please insert an item: ";
	        cin >> item;
	}
	
	cout << "\n\nLength: " << list1.Length() << endl;
	cout << "\nThe list is: " ;
	list1.Print();
	list1.SelSort();
	cout << "\nThe sorted list is: ";
	list1.Print();
	
	cout << "\n\nDone.\n\n";

	return 0;
}