Merge Sort 递归全景演示

Merge Sort 递归全景

准备开始...

Recursion Stack

mid

Step: 0

public static void mergeSort(int[] arr, int left, int right) {
if (left < right) {
int mid = (left + right) / 2;

mergeSort(arr, left, mid); // 递归左边

mergeSort(arr, mid + 1, right); // 递归右边

merge(arr, left, mid, right); // 合并
}
}