Method merge

MergeWithoutExtraSpace.java:2–17

(int arr1[], int arr2[], int n, int m)

class Solution {
public void merge(int arr1[], int arr2[], int n, int m) {
int i = 0, j = 0, k = n - 1;
        while (i <= k && j < m) {
            if (arr1[i] < arr2[j])
                i++;
            else {
                int temp = arr2[j];
                arr2[j] = arr1[k];
                arr1[k] = temp;
                j++;
                k--;
            }
        }
        Arrays.sort(arr1);
        Arrays.sort(arr2);
        }
        }