Insertion Sort in Data Structures using Java

Program 1

//Program for insertion sort
import java.util.*;

class InsertionSort
{
      public static void main(String args[])
      {
              int ar[],n,i,j,temp,k;
              Scanner scan=new Scanner(System.in);
              System.out.println("Enter the limit of array");
              n=scan.nextInt();
              ar=new int[n];
              System.out.println("Enter elements in array");   
              for(i=0;i<n;i++)
                ar[i]=scan.nextInt();
                for(k=1;k<n;k++)
                {
                     temp=ar[k];
                     j=k-1;    
                     while( j>=0 && temp<ar[j])
                     {
                         ar[j+1]=ar[j];
                         j--;
                     }
                     ar[j+1]=temp;
                }
                System.out.println("Sorted elements ");
                for(i=0;i<n;i++)
                  System.out.println(ar[i]);
      }
}