合并排序在C++

mergesort in C++

本文关键字:C++ 排序 合并      更新时间:2023-10-16
#include "stdafx.h"
#include <iostream>
using namespace std;
using namespace System;
void mergesort(int a[], int p, int r);
void merge(int a[], int p, int q, int r);
int main(array<System::String ^> ^args)
{
    int result[2] = { 1, 0 };
    int *p;
    p = result;
    mergesort(p, 0,1);
    while (1);
    return 0;
}
void mergesort(int a[],int p, int r)
{
    if (p < r)
    {
        int q = (p + r) / 2;
        mergesort(a, p, q);
        cout << endl;
        mergesort(a, q + 1, r);
        cout << endl;
        merge(a,p,q,r);
        for (int i = 0; i < 2; i++)
        {
            cout << a[i] << " ";
        }
        cout << endl;
    }
}
void merge(int a[], int p, int q, int r)
{
    int left[100] = {};
    int right[100] = {};
    for (int i = 0; i < (q - p + 1); i++)
    {
        left[i] = *(a + p + i);
        left[i + 1] = 999;
    }
    for (int i = 0; i < (r - q); i++)
    {
        right[i] = *(a + q + 1 + i);
        right[i + 1] = 999;
    }
    for (int k = p; k < r+1; k++)
    {
        int i = 0;
        int j = 0;
        if (left[i] <= right[j])
        {
            a[k] = left[i++];
        }
        else
        {
            a[k] = right[j++];      **// it always goes into this route? why does not left[i]<=right[j] work?**
        }
    }
}

这是我关于基本合并排序的代码。我无法在合并函数中输入第一个 IF 语句。为什么if (left[i] <= right[j])不起作用?我试过了,无论left[i]是什么。程序只是转到 else 语句。

for (int k = p; k < r+1; k++)
{
    int i = 0;
    int j = 0;
    if (left[i] <= right[j])
    {
        a[k] = left[i++];
    }
    else
    {
        a[k] = right[j++];      **// it always goes into this route? why does not left[i]<=right[j] work?**
    }
}

这不会做你认为它做的事情。它将始终将left[0]right[0]进行比较,因为您在for循环中声明了ij,因此它们将在每次迭代时重置为0。

要使它们保留其值,请在循环外部声明它们:

int i = 0;
int j = 0;
for (int k = p; k < r+1; k++)
{
    if (left[i] <= right[j])
    {
        a[k] = left[i++];
    }
    else
    {
        a[k] = right[j++];      **// it always goes into this route? why does not left[i]<=right[j] work?**
    }
}

如果您的目的是仅在循环中使用变量 i 和 j,请尝试通过执行以下操作将 i 和 j 的作用域限制在循环中。

for (int k = p, i = 0, j = 0; k < r+1; k++)
{
    if (left[i] <= right[j])
    {
        a[k] = left[i++];
    }
    else
    {
        a[k] = right[j++];      
    }
}