Insert Sort method (Java implementation)

public class Insertsort {public static void main (string[] args) {//array declaration int[] A = {5,1,3,0,1,4,-1};int L = a.length;//First make sure the top two An element is ascending if (a[1]<a[0]) {int tmp=a[0];a[0]=a[1];a[1]=tmp;} Next insert sort for (int i=2;i<l;i++) {//If the number to be inserted is less than or equal to the sorted header if (a[i]<=a[0]) {int tmp=a[i];for (int j=i;j>0;j--) {A[j] =A[J-1];} A[0]=tmp;} If the number to be inserted is greater than or equal to the ordered footer else if (a[i]>=a[i-1]) continue;//If the number to be inserted is between a two number in the sorted table else{for (int k=0;k<i-1;k++) {if (a[ I]>=a[k]&&a[i]<=a[k+1]) {int tmp1=a[i];for (int m=i;m>k+1;m--) {a[m]=a[m-1];} A[K+1]=TMP1;}}}} for (int element:a) System.out.println (element+ "");}}

Insert Sort method (Java implementation)