十大排序之归并排序

cpp代码实现

#include <iostream>
#include <ctime>
#include <cstdlib> 
#include <cstdio>

#define N 50


typedef struct {
    int data[1024];
    int length;
} IntList;

using namespace std;


void merge(IntList *l, int l1, int r1, int l2, int r2) {
    int i = l1, j = l2;
    IntList tmp;
    tmp.length = 0;
    while (i <= r1 && j <= r2) {
        if (l->data[i] <= l->data[j]) {
            tmp.data[tmp.length++] = l->data[i++];
        } else {
            tmp.data[tmp.length++] = l->data[j++];
        }
    }
    while (i <= r1) {
        tmp.data[tmp.length++] = l->data[i++];
    }
    while (j <= r1) {
        tmp.data[tmp.length++] = l->data[j++];
    }
    for (int i = 0; i < tmp.length; ++i) {
        l->data[l1 + i] = tmp.data[i];

    }

}


void mergeSort(IntList *l, int left, int right) {
    if (left < right) {
        int mid = (left + right) / 2;
        mergeSort(l, left, mid);
        mergeSort(l, mid + 1, right);
        merge(l, left, mid, mid + 1, right);
    }
}

int main() {
    IntList l;
    l.length = 0;
    srand((unsigned int) time(NULL));
    for (int i = 0; i < N; ++i) {
        l.data[l.length++] = rand() % 100;
    }
    printf("排序前:\n");
    for (int i = 0; i < l.length; ++i) {
        printf("%d ", l.data[i]);
    }
    printf("\n==================================================\n");
    mergeSort(&l, 0, l.length - 1);
    printf("排序后:\n");
    for (int i = 0; i < l.length; ++i) {
        printf("%d ", l.data[i]);
    }

    return 0;
}

H:\CPP_pro\pro01\a.exe
排序前:
26 87 61 76 77 31 3 84 70 98 26 59 77 47 2 25 94 59 28 92 9 98 99 26 32 58 73 13 17 65 55 18 65 36 47 83 38 73 64 53 3 1
9 35 92 56 46 49 9 49 61
==================================================
排序后:
2 3 3 9 9 13 17 18 19 25 26 26 26 28 31 32 35 36 38 46 47 47 49 49 53 55 56 58 59 59 61 61 64 65 65 70 73 73 76 77 77 83
 84 87 92 92 94 98 98 99
Process finished with exit code 0