insertion sort in java

import java.util.Arrays;


public class Insersort {

public static void main(String[] args)
{

int[] ar={2,4,1,5,3};
for(int i=0;i<ar.length;i++)
{

for(int j=i;j>0;j--)
{



if(ar[j]<ar[j-1])
{

int tmp=ar[j];
ar[j]=ar[j-1];

ar[j-1]=tmp;
}
}
}
System.out.println(Arrays.toString(ar));
}
}