import java.util.Vector;
public class  TestSelectionSort
{
	public static void main(String[] args) 
	{
		
		int[] somearray={3,15,-2,6,25,18,10,22,1};

		int[] newarray=selectionSort(somearray);
		for(int i=0; i<newarray.length; i++)
		   System.out.println(newarray[i]);
	}


	public static int [] selectionSort(int [] nonsorted)
	{
			int [] sorted=new int[nonsorted.length];
			
			for(int j=0; j<sorted.length; j++)
			{
				sorted[j]=nonsorted[j];
			}
			int subarraylength=0;
			int index=0;
			for (int j=0; j<=sorted.length-1; j++ )
			{
					subarraylength=sorted.length-j;
							  //find index of largest element in subarray
					index=0;
					for (int k=1; k<subarraylength; k++)
					{
						if (sorted[k] > sorted[index])
						{
							index=k;					
						}
					}		     
					
					// Now swap array elements 
					int temp=sorted[index];
					sorted[index]=sorted[sorted.length-j-1];
					sorted[sorted.length-j-1]=temp;

				}//end top for
				return sorted;
	}

	public Vector selectionSortVector(Vector vec)
	{
		Vector v=new Vector();
		for (int i=0; i<vec.size()-1; i++)
		{
		
			v.add(i, vec.get(i));
		
		}
		return v;
	}
}


/*OUTPUT
---------- Java Interpreter ----------
-2
1
3
6
10
15
18
22
25

Output completed (0 sec consumed) - Normal Termination */