Implement merge sort recursively

This was the psudeocode provided:

This is what i have currently:

public static void mergeSort(int[] arr, int low, int high) { if (low

public static void merge(int[] arr, int low, int mid, int high) { int n1 = (mid - low + 1); int n2 = (high - mid); int[] left = new int[n1 + 1]; int[] right = new int[n2 + 1]; int i = 1; int j = 1; for (i = 1; i

I'm feeling pretty sick and keep getting index errors, i think it's because the psudeocode is 1-based but i can't afford to spend any more time on this.

Merge & recursive Merge-sort (shown here is for 1-indexed). MergeSort(Array A, p, r){ if p,1,4,6) MergeSort(,1,6) Pictorial schematic Merge (A, p, q, r){ n1 = q - p + 1 n2 = r - a create L[1 ... n1+1] and R[1 ... n2+1] for i = 1 to ni L[i] = A[p+i-1] for j = 1 to n2 R[j] = A[q+j] L[n1+1] = infinity; R[n2+1] = infinity i = j = 1 for k = p to r if L[i] is less than or equal to R[j] A[k] = L[i] i = i + 1 else A[k] = R[j] j = m + 1