如何在Java与Python实现一个归并排序算法

package com.algorithm.sort.merge;import java.util.Arrays;public class Merge {  public static void main(String[] args) {    int[] nums = {6, 5, 3, 1, 7, 2, 4};    nums = mergeSort(nums);    System.out.println(Arrays.toString(nums));  }    private static int[] mergeSort(int[] nums) {    segment(nums, 0, nums.length - 1);    return nums;  }    private static void segment(int[] nums, int left, int right) {    if (left >= right)      return;    // 找出中间索引    int center = (left + right) / 2;    // 对左边数组进行递归    segment(nums, left, center);    // 对右边数组进行递归    segment(nums, center + 1, right);    // 合并    merge(nums, left, center, right);  }    private static void merge(int[] nums, int left, int center, int right) {    int[] tmpArray = new int[nums.length];    int rightIndex = center + 1;  // 右数组第一个元素索引    int tmpIndex = left;  //临时数组索引    int begin = left;  // 缓存左数组第一个元素的索引，用于将排好序的数组拷贝回原数组    while (left <= center && rightIndex <= right) {      if (nums[left] <= nums[rightIndex]) {        tmpArray[tmpIndex++] = nums[left++];      } else {        tmpArray[tmpIndex++] = nums[rightIndex++];      }    }    while (left <= center) {      tmpArray[tmpIndex++] = nums[left++];    }    while (rightIndex <= right) {      tmpArray[tmpIndex++] = nums[rightIndex++];    }    while (begin <= right) {      nums[begin] = tmpArray[begin++];    }  }}