void merge(int A[], int p, int q, int r)
{
    int* Moja_Lewa_Tablica = (int*)malloc(q-p+2)*sizeof(int));
    int* Moja_Prawa_Tablica =(int*)malloc(r-q+1)*sizeof(int));
    for (int iterator = 0; iterator < q - p + 1; iterator++)
    {
        Moja_Lewa_Tablica[iterator] = A[p + iterator];
    }
    Moja_Lewa_Tablica[q - p + 1] = 1000;
    for (int iterator = 0; iterator < r - q; iterator++)
    {
        tright[iterator] = A[q + iterator + 1];
    }
    Moja_Prawa_Tablica[r - q] = 1000;

    int prawy_iterator = 0; int lewy_iterator = 0;
    for (int iterator = p; iterator <= r; iterator++)
    {
        if (Moja_Prawa_Tablica[prawy_iterator] < Moja_Lewa_Tablica[lewy_iterator])
        {
            A[iterator] = Moja_Prawa_Tablica[prawy_iterator];
            prawy_iterator++;
        }
        else
        {
            A[iterator] = Moja_Lewa_Tablica[lewy_iterator];
            lewy_iterator++;
        }
    }
    return;
}