Merge As In Mergesort

Merge.java

import java.util.Arrays;

/**
 * Merge as in MergeSort
 * 
 * @author Daniel Kohlsdorf
 */
public class Merge {

	public static int[] merge(int x[], int y[]) {
		int merged[] = new int[x.length + y.length];
		int i = 0;
		int j = 0;
		int pos;
		for (pos = 0; pos < x.length + y.length; pos++) {
			if (i < x.length && j < y.length) {
				if (x[i] < y[j]) {
					merged[pos] = x[i];
					i++;
				} else {
					merged[pos] = y[j];
					j++;
				}
			}
		}
		pos -= 1;

		for(; i < x.length; i++, pos++) {
			merged[pos] = x[i];
		}
		for(; j < y.length; j++, pos++) {
			merged[pos] = y[j];
		}
		return merged;
	}

	public static void main(String[] args) {
		System.out.println(Arrays.toString(merge(new int[] { 3, 4, 5, 23 },
				new int[] { 1, 2, 10 })));
	}

}