package com.org.arrays.sort;

//插入排序法
public class TestInsert {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		int[] ary = { -1, -3, 5, 7, 9, 2, 4, 6, 8, 10 };
		System.out.print("整数排序前：");
		for (int ar : ary) {
			System.out.print(ar + "\t");
		}
		System.out.println();
		insertSort(ary);
		System.out.print("整数排序后：");
		for (int a : ary) {
			System.out.print(a + "\t");
		}

	}

	/** 插入排序 */
	public static int[] insertSort(int[] ary) {
		int i, j, t;
		for (i = 1; i < ary.length; i++) {
			t = ary[i];
			for (j = i - 1; j >= 0; j--) {
				if (t < ary[j]) {
					ary[j + 1] = ary[j];
				} else {
					break;
				}
			}
			ary[j + 1] = t;
		}
		return ary;
	}

}