insertSort

public static int[] insertSort(int[] arr){
        int i,j,idx,jdx,n,ndx,flag,fdx;
        int[] brr=new int[arr.length];

        //in 1st loop,cannot execute the loop,so initialize the first element
        brr[0]=arr[0];
        //loop start from 2nd element
        for(i=2;i<=arr.length;i++){
            printArr(brr);
            idx=i-1;
            flag=1;
            for(j=i-1;j>=1;j--){
                jdx=j-1;
                if(arr[idx]>brr[jdx])
                {flag=j+1;break;}
                
                    

            }
            fdx=flag-1;

            //larger than flag,include flag,empty flag postion, push 1 postion
            for(n= i-1;n>= flag;n--){
                ndx=n-1;
                //push 1 postion;
                brr[ndx+1]=brr[ndx];

            }
            brr[fdx]=arr[idx];

            // V(j+1)=v(i);
            



        }
        return brr;

    }