CLRS 归并排序实现
#include <iostream>
#define NIL 666
using namespace std;
#define WUQIONG 99999
#define len 1000
void MERGE(int *A, int p, int q, int r)
{
int n1 = q - p + 1;
int n2 = r - q;
int* R = (int*)malloc(sizeof(int)*(n1 + 1));
int* L = (int*)malloc(size
原创
2022-01-15 03:20:33 ·
235 阅读 ·
0 评论