Insertion Sort Java Program

import java.util.Scanner;
public class ISort
{
 
public static void Sort(int a[])
{ 
int n=a.length,i,j,p,temp;
for (i = 1;i < n; i++) 
{ 
 
for (j=i-1; j >=0 && a[j+1]<a[j]; j--)
{ 
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
 
} 
 
} 
}
public static void printarray(int a[])
{
for(int i=0; i < a.length; i++)
{
 
System.out.print(a[i]+" ");
}
 
}
public static void main(String[] args) 
{
int n, res,i;
Scanner s = new Scanner(System.in);
System.out.print("Enter number of elements in the array:");
n = s.nextInt();
int a[] = new int[n];
System.out.println("Enter "+n+" elements ");
for( i=0; i < n; i++)
{
a[i] = s.nextInt();
}
 
System.out.println( "elements in array ");
printarray(a);
Sort(a);
System.out.println( "\nelements after sorting");
printarray(a);
 
}
 
 
}

Output:

put For Insertion Sort Java ProgramJava
Enter number of elements in the array:5
Enter 5 elements
9
5
0
1
8
elements in array
9  5  0  1  8
elements after sorting
0  1  5  8  9