// Page 174-176

public class List
{
	private final int MAX = 50;
	private int length;
	private int[] data = new int[MAX];
	public List()
	{
		length = 0;
	}
	public int Length()
	{
		return length;
	}
	public boolean IsFull ()
	{
		return (length == MAX);
	}
	public boolean IsEmpty ()
	{
		return (length == 0);
	}
	public void Print ()
	{
		for (int k=0; k<length; k++)
			System.out.print(data[k] + " ");
		System.out.println();
	}
	public void Insert (int item)
	{
		data[length] = item;
		length ++;
	}
	public boolean IsPresent(int item)
	{
		boolean done = false;
		for (int k=0; k<length && !done; k++)
			if (data[k] == item)
				done = true;
		return done;
	}
	public void SelSort ()	// ascending
	{
		int temp;	// for swapping
		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;
		}
	}
		public void SelSort_D ()
		{
			int temp;	// for swapping
			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;
			}
	}
}