Merge Sort Hacks

public class MergeSort {


    public static void sort(String arr[], int l, int r) {
        if (l < r) {
            // COMMENT A
            int m = l + (r - l) / 2;

            // COMMENT B
            sort(arr, l, m);
            sort(arr, m + 1, r);

            // COMMENT C
            merge(arr, l, m, r);
        }

    }

    public static void merge(String arr[], int l, int m, int r) {
            // Find the sizes of two subarrays to be merged
            int n1 = m - l + 1;
            int n2 = r - m;

            /* Create temp arrays */
            String[] L = new String[n1];
            String[] R = new String[n2];

            /* Copy data to temp arrays */
            for (int i = 0; i < n1; ++i)
                L[i] = arr[l + i];
            for (int j = 0; j < n2; ++j)
                R[j] = arr[m + 1 + j];

            /* Merge the temp arrays */

            // Initial indexes of first and second subarrays
            int i = 0, j = 0;

            // Initial index of merged subarray array
            int k = l;
            while (i < n1 && j < n2) {
                if (L[i].compareTo(R[j]) <= 0) {
                    arr[k] = L[i];
                    i++;
                }
                else {
                    arr[k] = R[j];
                    j++;
                }
                k++;
            }

            /* Copy remaining elements of L[] if any */
            while (i < n1) {
                arr[k] = L[i];
                i++;
                k++;
            }

            /* Copy remaining elements of R[] if any */
            while (j < n2) {
                arr[k] = R[j];
                j++;
                k++;
            }
    }

    public static void main(String[] args) {
        String[] stringArray = {"book", "apple", "cat"};
        MergeSort.sort(stringArray, 0, stringArray.length - 1);
        for (String word : stringArray) {
            System.out.print(word + " ");
        }
    }
}
MergeSort.main(null)

apple book cat