插入排序实现

public class InsertSort {

    /**
     * @param args
     */
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int []ary =new int[]{2,5,1,4,8,3,6,9};
        //int []ary={2,5,1,4,8,3,6,9};
        ary=insertSort(ary);
        for(int i=0;i<ary.length;i++)
        {
            System.out.print(ary[i]+" ");
        }
    }
    
    public static int [] insertSort(int []ary)
    {
        for(int i=1;i<ary.length;i++)
        {
            int temp=ary[i];
            int j;
            //for(j=i-1;j>=0&&temp<ary[j];j--)
            for(j=i-1;j>=0;j--)
            {
                if(temp<ary[j])
                {
                    ary[j+1]=ary[j];
                }else
                    break;
            }
            ary[j+1]=temp;//插入
        }
        return ary;
    }
}