排序复制数组

package perpor.jisuan;

public class Combine2 {

	public static void main(String[] args) {

		int[] a = new int[] { 6, 57, 2, 8, 38, 241, 85, 7, 8, 48, 10, 82, 3 };

		int[] b = new int[5];
		printArray(insertAndSort(a, b));

	}

	private static int[] insertAndSort(int[] a, int[] b) {

		int al = a.length;
		int bl = b.length;
		b[0] = a[0];

		for (int i = 1; i < al; i++) {
			if (i < bl) {
				b[i] = a[i];
				int j = i;
				while (j > 0 && b[j - 1] > a[i]) {
					b[j] = b[j - 1];
					j--;
				}
				b[j] = a[i];
			} else {
				int j = bl - 1;
				if (a[i] > b[j]) {
					continue;
				}
				while (j > 0 && b[j] > a[i]) {
					b[j] = b[j - 1];
					j--;
				}
				b[j + 1] = a[i];
			}
		}
		return b;
	}

	public static void printArray(int[] pData) {
		for (int i = 0; i < pData.length; i++)
			System.out.print(pData[i] + " ");

	}

}