C语言：随机生成数+快速排序_c语言生产n个随机数并快速排序代码

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define MAXSIZE 10
void initArr(int arr[] , int length);
void showArr(int arr[] , int length);
void quickSort(int arr[] , int left , int right);
int main()
{
	srand((unsigned int)time(NULL));
	int arr[MAXSIZE];
	printf("==========排序前的序列=============\n");
	initArr(arr,MAXSIZE);
	showArr(arr,MAXSIZE);
	printf("==========快速排序后的序列=============\n");
	quickSort(arr,0,MAXSIZE-1);
	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 quickSort(int arr[] , int left , int right)
{
	//快速排序
	if(left>right){
		return;
	}
	int i = left;
	int j = right;
	int pivot = arr[i];
	while(i<j){
		while(i<j && arr[j] >= pivot){
			j--;
		}
		arr[i] = arr[j];
		while(i<j && arr[i] <= pivot){
			i++;
		}
		arr[j] = arr[i]; 
	}	
	arr[i] = pivot;
	quickSort(arr,left,i-1);
	quickSort(arr,i+1,right);
} 
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