How does this merge algorithm (mergeSort) work?

Question

Java

public static void mergeSort(int[] array, int low, int high) {
        if (high - low < 2) {
            return;
        }
        int mid = (low + high) >>> 1;
        mergeSort(array, low, mid);
        mergeSort(array, mid, high);
        int[] b = Arrays.copyOfRange(array, low, mid);
        for (int i = low, j = mid, k = 0; k < b.length; i++) {
            if (j == high || b[k] <= array[j]) {
                array[i] = b[k++];
            } else {
                array[i] = array[j++];
            }
        }
    }

I understand how it works visually, but in code, it is very difficult for me to navigate here. Please, if you have the time and energy, please explain in detail what and how it works here, I will be very GRATEFUL to you.
Thanks in advance for your ANSWER!

Answer 1

Item 2 German dance
https://forany.xyz/a-370