时间差就是完成时间

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
#include<stdio.h>
int partition(int arr[], int low, int max) {
	int i = low - 1;
	int temp;
	int mid = arr[max];
	for (int j = low;j < max;j++) {
		if (arr[j] <= mid) {
			i++;
			temp = arr[i];
			arr[i] = arr[j];
			arr[j] = temp;
		}
	}
	temp = arr[i + 1];
	arr[i + 1] = arr[max];
	arr[max] = temp;
	return i+1;
}
void quickSort(int arr[], int low, int max) {
	if (low < max) {
		int middle = partition(arr, low, max);
		quickSort(arr, middle+1, max);
		quickSort(arr, low, middle-1);
	}
}
void printarr(int arr[], int b) {
	for (int i = 0; i < b; i++) {
		printf("%d,", arr[i]);
	}
}

/*残疾c连arraylist都没有666*/
int main(void) {
	int a1[10];
	for (int i = 0;i < 10;i++) {
		scanf_s("%d", &a1[i]);

	}
	int n = sizeof(a1) / sizeof(a1[0]);/*
	int占位大小一定，arr里面元素占位就是整体大小*/
	quickSort(a1, 0,n-1);
	printarr(a1, n);
	return	0;
}