//
//		page 137
//		ADT - Lists: array of items with variable length
//		read the strings from a file and put them in the list; 
//		then output the strings

#include <iostream>
using namespace std;

const int MAX = 50;

class List
{
	int data[MAX];
	int length;
public:
	List() { length = 0;   }
	int Length() const
	{	return length;	}
	void Insert(int item)
	{	data[length] = item;
		length ++;
	}
	void Print() const
	{	for(int i=0; i<length; i++)
			cout << data[i] << " ";
		cout << "\n";
	}
	// sequential search, p.139
	bool IsPresent(int item) const
	{	bool found = false;
		for(int i=0; i<length && !found; i++)
			if(data[i] == item) found = true;
		return found;
	}
	void SelectionSort()	// p.140 - ascending oder
	{	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];	// swap
			data[minIndex] = data[passCount];
			data[passCount] = temp;
		}
	}
	void SelectionSort_R()	// descending
	{ 	int 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];  // swap
                        data[maxIndex] = data[passCount];
                        data[passCount] = temp;
                }
        }
};

int main()
{
	List real;
	// read the data in, p.138
	int x;	// hold each item
	cin >> x;
	while(cin)
	{	real.Insert(x);
		cin >> x;
	}
	// out	
	cout << "Before sort: ";
	real.Print();

	cout << "Ascending order - ";
	real.SelectionSort();
	real.Print();

	return 0;
}