void merge(char arr[], int l, int m, int r) //001,
{
    int i, j, k;
    int n1 = m - l + 1;
    int n2 =  r - m;

    char L[n1], R[n2];

    for (i = 0; i < n1; i++)
        L[i] = arr[l + i];
    for (j = 0; j < n2; j++)
        R[j] = arr[m + 1+ j];

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

    while (i < n1)
    {
        arr[k] = L[i];
        i++;
        k++;
    }

    while (j < n2)
    {
        arr[k] = R[j];
        j++;
        k++;
    }
    //cout << "Run Details:" <<endl;
    //printArray(L,n1);
    //printArray(R,n2);
    //cout << "Comparisons = " << comparisons << endl;
}