插入排序算法

public class Test35{
	public static void main(String[] args){
		int[] sort_insert = new int[]{99,45,23,67,38,78,13};
		int len = sort_insert.length;
		for(int i=0;i<len-1;i++){
			for(int j=i+1;j>0;j--){
				if(sort_insert[j]<=sort_insert[j-1]){
					sort_insert[j] = sort_insert[j] + sort_insert[j-1];
					sort_insert[j-1] = sort_insert[j] - sort_insert[j-1];
					sort_insert[j] = sort_insert[j] - sort_insert[j-1];
				}
				else
					break;
			}
		}
		for(int x:sort_insert)
			System.out.print(x+" ");
		System.out.println();
	}
}

运行结果：

另：

public class zhijiecharupaixu {
    public static void main(String[] args) {
        int[] nums = {23,12,45,34,67,14,55,18};
        for (int i=1;i<nums.length;i++){
            int temp=nums[i];
            int j=0;
            for (j=i-1;j>=0;j--){
                if (nums[j]>temp){
                    nums[j+1]=nums[j];
                }
                else{
                    break;
                }
            }
            if (nums[j+1]!=temp){
                nums[j+1]=temp;
            }
        }
        for (int num : nums) {
            System.out.print(num+" ");
        }
    }
}

运行结果：