归并排序中关于栈空间活动的理解

归并排序体现了分、治的思想，在分的过程中涉及到递归。
一直觉得递归时压栈和出栈的过程不太好理解，所以绘制了一张示意图辅助学习归并排序算法。

关于算法的讲解参考了：
https://www.bilibili.com/video/BV1E4411H73v?p=70
对数组进行归并排序，分和治的过程如图所示

代码为：

package com.company.sort;

import java.util.Arrays;

public class MergeSort {
	public static void main(String[] args) {
		int[] arr = {8,4,5,7,1,3,6,2};
		int[] temp = new int[arr.length];
		mergeSort(arr, 0, arr.length - 1, temp);
		//System.out.println(Arrays.toString(arr));
	}
	
	public static void mergeSort(int[] arr, int left, int right, int[] temp) {
		if(left < right) {
			int mid = (left + right) / 2;
			mergeSort(arr, left, mid, temp);
			System.out.println(Arrays.toString(arr));
			mergeSort(arr, mid + 1, right, temp);
			System.out.println(Arrays.toString(arr));
			merge(arr, left, mid, right, temp);
			System.out.println(Arrays.toString(arr));
		}
		
	}
	
	public static void merge(int[] arr, int left, int mid, int right, int[] temp) {
		int i = left;
		int j = mid + 1;
		int t = 0;
		
		while(i <= mid && j <= right) {
			if(arr[i] <= arr[j]) {
				temp[t] = arr[i];
				t++;
				i++;
			}else {
				temp[t] = arr[j];
				t++;
				j++;
			}
		}
		
		while(i <= mid) {
			temp[t] = arr[i];
			t++;
			i++;
		}
		while(j <= right) {
			temp[t] = arr[j];
			t++;
			j++;
		}
		
		t = 0;
		int tempLeft = left;
		while(tempLeft <= right) {
			arr[tempLeft] = temp[t];
			t++;
			tempLeft++;
		}
	}
}

压栈和出栈过程如图所示