My Merge Sort Code gives wrong output

#1

Code:-

public class MergeSort {

public static void main(String[] args) {
	int[] arr = { 20, 10, 30, 50, 60, 5, 80, 25 };
	int[] ans = mergeSort(arr, 0, arr.length - 1);
	for (int val : ans) {
		System.out.print(val + " ");
	}
}

public static int[] mergeSort(int[] arr, int lo, int hi) {
	if (lo == hi) {
		int[] br = new int[1];
		br[0] = arr[lo];
		return br;
	}
	int mid = (lo + hi) / 2;
	int[] fh = mergeSort(arr, lo, mid);
	int[] sh = mergeSort(arr, mid + 1, hi);
	int[] merge = merge2SortedArrays(fh, sh);
	return merge;

}

public static int[] merge2SortedArrays(int[] arr1, int[] arr2) {
	int[] merged = new int[arr1.length + arr2.length];
	int i = 0, j = 0, k = 0;
	while (i < arr1.length && j < arr2.length) {
		if (arr1[i] <= arr2[j]) {
			merged[k] = arr1[i];
			i++;
			k++;
		} else {
			merged[k] = arr2[j];
			j++;
			k++;
		}
	}
	if (i == arr1.length) {
		while (j < arr2.length) {
			merged[k] = arr2[j];
			j++;
			k++;
		}
	}
	if (j == arr2.length) {
		while (j < arr1.length) {
			merged[k] = arr1[j];
			i++;
			k++;
		}
	}
	return merged;
}

}

Output:-
5 0 10 0 25 0 0 0

#2

You needn’t return arrays from merge and mergesort arrays. Use the original array to divide it into 2 parts. But don’t return anything from merge and mergesort.
see this