//List ADT Implemantation

#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()	// observer
	{	return length;	}
	bool IsEmpty() const 	// observer
	{	return length == 0;	}
	bool IsFull() const	// observer
	{	return length == MAX;	}
	void Insert(int item)	// transformer
	{ 	data[length] = item; length++;	}	
	bool IsPresent(int item) const;		// prototype
	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;	// for swapping
	int passCount;
	int minIndex;	// hold the index of the minimum
	// total ( length - 1) passes
	for ( passCount=0; passCount<length-1; passCount ++)
	{ 	minIndex = passCount;
		for (int i=passCount+1; i<length; i++ )
		{	if (data[minIndex] > data [i] )
				minIndex = i;
		}
		temp = data[minIndex];
		data[minIndex] = data[passCount];
		data[passCount] = temp;
		}
	}

int main()
{	
	List list1;
	int item;
	cout << "Input an Integer? ";
	cin >> item;
	while(cin)	
	{	list1.Insert(item);
		cout << "Input an Integer: ";
		cin >> item;
	}
	// debug
	cout << "\nLength: " << list1.Length() << endl; // 4
	cout << "The list is: " ;
	list1.Print();
	list1.SelSort();
	cout << "\n\nThe sorted List: ";
	list1.Print();
	cout << " \n\nGoodbye.\n\n";
	return 0;
}