Thread: How to merge an int array then put it in ascending order without any Java APIs

This is what I have:

package challengespackage;
 
public class ArrayMerge {
 
	public static void main(String[] args) {
		System.out.print(merge(new int[] { 9, 3, 0 }, new int[] { 4, 7, 8 }));
	}
 
	private static int[] merge(int[] iArrOne, int[] iArrTwo) {
		int[] iArrMerged = new int[iArrOne.length + iArrTwo.length];
 
		for (int i = 0; i < iArrOne.length; i++) {
			iArrMerged[i] = iArrOne[i];
		}
 
		for (int j = 0; j < iArrTwo.length; j++) {
			iArrMerged[iArrOne.length + j] = iArrTwo[j];
		}
 
		return iArrMerged;
	}
}

So far all it does is combine to two arrays. I am unsure of how to sort the array in ascending order without using any Java APIs like Arrays.sort();. Any help is appreciated!

Are the two arrays guaranteed to be sorted before you merge them?

If not, you can either sort each array separately and then merge them, or merge the two arrays and then sort them. There's not much difference if neither array is sorted to begin with (probably simply combine the two arrays together and then sort would be easier).

If one or both of the arrays are already sorted, then you want to make sure both arrays are sorted.

Once you've got the two arrays sorted, there's a merge algorithm provided here (scroll part way down the page). You could even use the complete merge sort algorithm to sort your two arrays, and then just call the merge function to merge your two arrays together.