Skip to content
TheChatArchiveThe Chat Archive
gpt-3.5-turbo-0613· openaiHugging Face Suzhen/CodeChat

请用java语言实现归并排序

  1. User

    请用java语言实现归并排序

  2. Assistant

    归并排序是一种分治算法,它将一个数组分成两个子数组,分别对这两个子数组进行排序,然后合并两个子数组以得到排序后的数组。

    下面是使用Java实现归并排序的代码:

    public class MergeSort {
        public void merge(int[] arr, int left, int mid, int right) {
            int n1 = mid - left + 1;
            int n2 = right - mid;
    
            int[] leftArr = new int[n1];
            int[] rightArr = new int[n2];
    
            for (int i = 0; i < n1; ++i) {
                leftArr[i] = arr[left + i];
            }
            for (int j = 0; j < n2; ++j) {
                rightArr[j] = arr[mid + 1 + j];
            }
    
            int i = 0, j = 0;
            int k = left;
            while (i < n1 && j < n2) {
                if (leftArr[i] <= rightArr[j]) {
                    arr[k] = leftArr[i];
                    i++;
                } else {
                    arr[k] = rightArr[j];
                    j++;
                }
                k++;
            }
    
            while (i < n1) {
                arr[k] = leftArr[i];
                i++;
                k++;
            }
    
            while (j < n2) {
                arr[k] = rightArr[j];
                j++;
                k++;
            }
        }
    
        public 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);
            }
        }
    
        public static void main(String[] args) {
            int[] arr = {12, 11, 13, 5, 6, 7};
    
            MergeSort mergeSort = new MergeSort();
            mergeSort.mergeSort(arr, 0, arr.length - 1);
    
            System.out.println("排序后的数组:");
            for (int num : arr) {
                System.out.print(num + " ");
            }
        }
    }
    

    以上代码中,merge方法用于合并两个有序的子数组,mergeSort方法使用递归将数组分成两个子数组并排序,最后调用main方法对一个示例数组进行排序并输出结果。

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.