public static void insertSort(int[] data) {
		if (data == null || data.length <= 1)
			return;

		for (int i = 1; i < data.length; i++) {
			int j = 0, t = data[i];
			for (j = i; j > 0 && data[j - 1] > t; j--) {
				data[j] = data[j - 1];
			}
			data[j] = t;
		}
	}