merge two sorted arrays in java

	public int[] mergeTwoSortedIntArray(int[] foo, int[] bar) {
	int fooLength = foo.length;
	int barLength = bar.length;
	int[] merged = new int[fooLength + barLength];
	int fooPosition, barPosition, mergedPosition;
	fooPosition = barPosition = mergedPosition = 0;
	while (fooPosition < fooLength && barPosition < barLength) {
	if (foo[fooPosition] < bar[barPosition]) {
	merged[mergedPosition++] = foo[fooPosition++];
	} else {
	merged[mergedPosition++] = bar[barPosition++];
	}
	}
	while (fooPosition < fooLength) {
	merged[mergedPosition++] = foo[fooPosition++];
	}
	while (barPosition < barLength) {
	merged[mergedPosition++] = bar[barPosition++];
	}
	return merged;
	}
	//time complexity O(fooLength + barLength)
	//space complexity O(fooLength + barLength)

view raw mergeTwoSortedArray.java hosted with ❤ by GitHub