import java.io.*;
class SortIntArrayRec5
{

 public static void main(String[] args)
 throws IOException
 // Illustrates using selection sort to sort an array of integers.
 // In this case, selection sort is expressed recursively
 {
  int n;
  int[] array;
  BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
  System.out.print("Enter number of integers : ");
  n = Integer.parseInt(in.readLine());
  array = new int[n];
  for(int i=0; i<n; i++)
     {
      System.out.print("Enter integer "+i+": ");
      array[i] = Integer.parseInt(in.readLine());
     }
  System.out.println("The array you entered is:");
  System.out.println(arrayToString(array));
  sort(array);
  System.out.println("After sorting, the array is:");
  System.out.println(arrayToString(array));
 }

 private static String arrayToString(int[] a)
 {
  String str="[";
  if(a.length>0)
     {
      str+=a[0];
      for(int i=1; i<a.length; i++)
         str+="|"+a[i];
     }
  return str+"]";
 }

 public static void sort(int[] a)
 // Sort the contents of array a in ascending numerical order
 {
  sort(0,a);
 }

 private static void sort(int i,int[] a)
 // Sort the portion of array a starting from position i
 {
  if(i<a.length-1)
     {
      int pos = smallestPosFrom(i,i+1,a);
      swap(a,i,pos);
      sort(i+1,a);
     }
 }

 private static int smallestPosFrom(int pos,int j,int[] a)
 // Return the index of the smallest element in the section of
 // array a from that indexed j to the end of the array
 // or a[pos] if that is smaller
 {
  if(j==a.length)
     return pos;
  else 
     {
      if(a[j]<a[pos])
         pos=j;
      return smallestPosFrom(pos,j+1,a);
     } 
 }

 private static void swap(int[] a,int pos1, int pos2)
 // Swap the elements indexed pos1 and pos2 within array a
 {
  int temp;
  temp = a[pos1];
  a[pos1] = a[pos2];
  a[pos2] = temp;
 }

}