public class Main {
    public static void main(String[] args) {
        int[] num1 = {1, 5};
        int[] num2 = {3, 4};
        int dl = num1.length + num2.length;
        int[] num3 = new int[dl];
        int pos = 0;
        for (int i : num1) {
            num3[pos] = i;
            pos++;
        }
        for (int j : num2) {
            num3[pos] = j;
            pos++;
        }
        quicksort(num3, 0, dl-1);
        /*int srodkowy=0, mediana=0;
        for(int k: num3){
            if(num3.length%2==0){
                srodkowy=num3[(num3.length/2)];
                mediana=(srodkowy+(num3[(num3.length/2)+1]))/2;
            }else{
                srodkowy=num3[(num3.length/2)+1];
                mediana=srodkowy;
            }
        }System.out.println(mediana); */
        System.out.println(Arrays.toString(num3));
    }


    public static void quicksort(int[] tab, int l, int r) {
        int srodek = tab[(l + r) / 2];
        int p, q, x;
        p = l;
        q = r;
        do {
            while (tab[p] < srodek) p++;
            while (tab[q] > srodek) q++;
            if (p <= q) {
                x = tab[p];
                tab[p] = tab[q];
                tab[q] = x;
                p++;
                q--;
            }
        } while (p <= q);
        if (q > l) quicksort(tab, l, q);
        if (p < r) quicksort(tab, p, r);
    }
}