C语言：随机生成数+归并排序_随机数归并排序c语言

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <assert.h> 
#define MAXSIZE 10
void initArr(int arr[] , int length);
void showArr(int arr[] , int length);
void merge(int arr[],int low,int mid,int height,int *temp);
void merge_sort(int arr[],int low,int height,int *temp);
void mergeSort(int arr[],int length);
int main()
{
	srand((unsigned int)time(NULL));
	int arr[MAXSIZE];
	printf("==========排序前的序列=============\n");
	initArr(arr,MAXSIZE);
	showArr(arr,MAXSIZE);
	printf("==========归并排序后的序列=============\n");
	mergeSort(arr,MAXSIZE);
	showArr(arr,MAXSIZE);
	system("pause");
	return 0;
} 
void initArr(int arr[] , int length)
{
	for(int i = 0 ; i < length ; i++){
		arr[i] = rand()%20;
	}
}
void showArr(int arr[] , int length)
{
	for(int i = 0 ; i < length ; i++){
		printf("%4d",arr[i]);
	}
	printf("\n");
} 
void merge(int arr[],int low,int mid,int height,int *temp)
{
	int i = low;
	int j = mid+1;
	int k = low;
	while(i <= mid && j <= height){
		temp[k++] = arr[i]<arr[j]?arr[i++]:arr[j++];
	}
	while(i <= mid){
		temp[k++] = arr[i++];
	}
	while(j <= height){
		temp[k++] = arr[j++];
	}
	for(i = low ; i <= height ; i++){
		arr[i] = temp[i];
	}
}
void merge_sort(int arr[],int low,int height,int *temp)
{
	if(low>=height){
		return;
	}
	int mid = low + (height - low)/2;
	merge_sort(arr,low,mid,temp);
	merge_sort(arr,mid+1,height,temp);
	merge(arr,low,mid,height,temp);
}
void mergeSort(int arr[],int length)
{
	int *temp = (int *)malloc(sizeof(int)*length);
	assert(temp);
	merge_sort(arr,0,length-1,temp);
	free(temp);
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71