排序算法

c++版本

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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
#include<iostream>
#include<vector>
#include<cstdlib>
#include<ctime>
#include<algorithm>
using namespace std;

vector<int> getArray(int size, int maxValue) {
	srand((unsigned)time(nullptr));
	vector<int> arr(rand() % (size + 1));
	for (int i = 0; i < arr.size(); i++) {
		arr[i] = rand() % (maxValue + 1) - rand() % maxValue;
	}
	return arr;
}

vector<int> getArray(int size, int maxValue,bool flag) {
    // flag:是否有负数，true表示有
    vector<int> arr(size);
    static random_device rd;
    static mt19937 gen(rd());
    int nega=flag?-maxValue:0;
    uniform_int_distribution<> dist(nega, maxValue);
    for (size_t i = 0; i < size; ++i) {
        arr[i] = dist(gen);
    }
    return arr;
}

bool isEqual(vector<int> v1, vector<int> v2) {
	if (v1.size() != v2.size()) {
		return false;
	}
	for (int i = 0; i < v1.size(); i++) {
		if (v1[i] != v2[i]) {
			return false;
		}
	}
	return true;
}

void swap(int& a, int& b) {
	int tmp = a;
	a = b;
	b = tmp;
}
// 选择排序
void selectSort(vector<int>& nums) {
	int n = nums.size();
	for (int i = 0; i < n - 1; i++) {
		int k = i;
		for (int j = i + 1; j < n; j++) {
			if (nums[j] < nums[k]) {
				k = j;
			}
		}
		swap(nums[i], nums[k]);
	}
}
// 冒泡排序
void bubbleSort(vector<int>& nums) {
	for (int i = nums.size() - 1; i > 0; i--) {
		bool flag = true;
		for (int j = 0; j < i; j++) {
			if (nums[j] > nums[j + 1]) {
				swap(nums[j], nums[j + 1]);
				flag = false;
			}
		}
		if (flag) {
			break;
		}
	}
}
// 插入排序
void insertSort(vector<int>& nums) {
	for (int i = 1; i < nums.size(); i++) {
		int tmp = nums[i];
		for (int j = i - 1; j >= 0 && nums[j] > tmp; j--) {
			nums[j + 1] = nums[j];
			nums[j] = tmp;
		}
	}
}

//void quickSort(vector<int>& nums,int left,int right) {
//	if (left >= right) {
//		return;
//	}
//	int i = left, j = right;
//	int tmp = nums[i];
//	while (i < j) {
//		while (i < j && nums[j] >= nums[left]) {
//			j--;
//		}
//		nums[i] = nums[j];
//		while (i < j && nums[i] <= nums[left]) {
//			i++;
//		}
//		nums[j] = nums[i];
//	}
//	nums[i] = tmp;
//	quickSort(nums, left, i - 1);
//	quickSort(nums, i + 1, right);
//}

int midNum(vector<int>& nums, int left, int mid, int right) {
	int a = nums[left], b = nums[mid], c = nums[right];
	if ((a <= b && b <= c) || (c <= b && b <= a)) {
		return mid;
	}
	if ((b <= a && a <= c) || (c <= a && a <= b)) {
		return left;
	}
	return right;
}
// 快速排序
void quickSort(vector<int>& nums, int left, int right) {
	if (left >= right) {
		return;
	}
	while (left < right) {
		int mid = midNum(nums, left, (left + right) / 2, right);
		swap(nums[left], nums[mid]);
		int i = left, j = right;
		while (i < j) {
			while (i < j && nums[j] >= nums[left]) {
				j--;
			}
			while (i < j && nums[i] <= nums[left]) {
				i++;
			}
			swap(nums[i], nums[j]);
		}
		swap(nums[i], nums[left]);
		if (i - left < right < i) {
			quickSort(nums, left, i - 1);
			left = i + 1;
		}
		else {
			quickSort(nums, i + 1, right);
			right = i - 1;
		}
	}
}

void merge(vector<int>& nums, int left, int mid, int right) {
	vector<int> tmp(right - left + 1);
	int i = left, j = mid + 1, k = 0;
	while (i <= mid && j <= right) {
		tmp[k++] = nums[i] < nums[j] ? nums[i++] : nums[j++];
	}
	while (i <= mid) {
		tmp[k++] = nums[i++];
	}
	while (j <= right) {
		tmp[k++] = nums[j++];
	}
	for (int i = 0; i < tmp.size(); i++) {
		nums[left + i] = tmp[i];
	}
}
// 合并排序
void mergeSort(vector<int>& nums, int left, int right) {
	if (left >= right) {
		return;
	}
	int mid = (left + right) / 2;
	mergeSort(nums, left, mid);
	mergeSort(nums, mid + 1, right);
	merge(nums, left, mid, right);
}

void siftDown(vector<int>& nums, int i, int n) {
	while (true) {
		int l = 2 * i + 1;
		int r = 2 * i + 2;
		int max = i;
		if (l<n && nums[l]>nums[max]) {
			max = l;
		}
		if (r<n && nums[r]>nums[max]) {
			max = r;
		}
		if (max == i) {
			break;
		}
		swap(nums[i], nums[max]);
		i = max;
	}
}
// 堆排序
void heapSort(vector<int>& nums) {
	for (int i = nums.size() / 2 - 1; i >= 0; i--) {
		siftDown(nums, i, nums.size());
	}
	for (int i = nums.size() - 1; i > 0; i--) {
		swap(nums[0], nums[i]);
		siftDown(nums, 0, i);
	}
}
// 计数排序
void countSort(vector<int>& nums) {
	int minn = nums[0], maxn = nums[0];
	for (int num : nums) {
		minn = min(num, minn);
		maxn = max(num, maxn);
	}
	vector<int> count(maxn - minn + 1, 0);
	for (int num : nums) {
		count[num - minn]++;
	}
	for (int i = 0; i < maxn - minn; i++) {
		count[i + 1] += count[i];
	}
	int n = nums.size();
	vector<int> res(n);
	for (int i = n - 1; i >= 0; i--) {
		int num = nums[i];
		res[count[num-minn] - 1] = num; // 将 num 放置到对应索引处
		count[num- minn]--;
	}
	nums = res;
}
// 基数排序
void radixSort(vector<int>& nums) {
	int maxn = nums[0], n = nums.size();
	for (int i = 0; i < n; i++) {
		if (nums[i] > maxn) {
			maxn = nums[i];
		}
	}
	for (int exp = 1; exp <= maxn; exp *= 10) {
		vector<int> count(10, 0);
		for (int i = 0; i < n; i++) {
			int d = (nums[i] / exp) % 10;
			count[d]++;
		}
		for (int i = 0; i < 9; i++) {
			count[i + 1] += count[i];
		}
		vector<int> res(n, 0);
		for (int i = n - 1; i >= 0; i--) {
			int d = (nums[i] / exp) % 10;
			res[count[d] - 1] = nums[i];
			count[d]--;
		}
		nums = res;
	}
}

int main() {
	vector<int> res = { 105,56,428,348,818 };
	radixSort(res);
	for (int i = 0; i < res.size(); i++) {
		cout << res[i] << " ";
	}
	cout << endl;
	//int testTime = 100000;
	//int size = 100;
	//int maxValue = 100;
	//bool flag = true;
	//for (int i = 0; i < testTime; i++) {
	//	vector<int> arr = getArray(size, maxValue);
	//	vector<int> arr1 = arr;
	//	//selectSort(arr);
	//	//bubbleSort(arr);
	//	//insertSort(arr);
	//	//quickSort(arr, 0, arr.size() - 1);
	//	//mergeSort(arr, 0, arr.size() - 1);
	//	heapSort(arr);
	//	sort(arr1.begin(), arr1.end());
	//	flag = isEqual(arr, arr1);
	//	if (!flag) {
	//		break;
	//	}
	//}
	//cout << boolalpha << flag << endl;
	return 0;
}

c语言版本

冒泡排序

1
2
3
4
5
6
7
8
9
10
11
12
void bubSort(int arr[],int length)
{
	while(length--) {
		for(int i=0; i<length; i++) {
			if(arr[i]>arr[i+1]) {
				int tmp=arr[i];
				arr[i]=arr[i+1];
				arr[i+1]=tmp;
			}
		}
	}
}

选择排序

1
2
3
4
5
6
7
8
9
10
11
12
13
14
void selectSort(int arr[],int length)
{
	for(int i=0; i<length; i++) {
		int k=i;
		for(int j=i+1; j<length; j++) {
			if(arr[j]<arr[k]) {
				k=j;
			}
		}
		int tmp=arr[i];
		arr[i]=arr[k];
		arr[k]=tmp;
	}
}

插入排序

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
void insertSort(int arr[],int length)
{
//	for(int i=1; i<length; i++) {
//		for(int j=i; j>=1&&arr[j-1]>arr[j]; j--) {
//			int tmp=arr[j-1];
//			arr[j-1]=arr[j];
//			arr[j]=tmp;
//		}
//	}
	for(int i=1; i<length; i++) {
		int tmp=arr[i];
		for(int j=i; j>=1&&arr[j-1]>tmp; j--) {
			arr[j]=arr[j-1];
			arr[j-1]=tmp;
		}
	}
}

希尔排序

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
void shellSort(int arr[],int length)
{
	int h=1;
	int t=length/3;
	while(h<t) {
		h=3*h+1;
	}
	while(h>=1) {
		for(int i=h; i<length; i++) {
			int tmp=arr[i];
			for(int j=i; j>=h&&arr[j-h]>tmp; j-=h) {
				arr[j]=arr[j-h];
				arr[j-h]=tmp;
			}
		}
//		for(int i=h; i<length; i++) {
//			for(int j=i; j>=h&&arr[j-h]>arr[j]; j-=h) {
//				int tmp=arr[j-h];
//				arr[j-h]=arr[j];
//				arr[j]=tmp;
//			}
//		}
		h/=3;
	}
}

快速排序

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
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
void quickSort2(int arr[],int left,int right)
{
	if(left>=right) {
		return;
	}
	int pivot=arr[left];
	int i=left+1;
	int j=left+1;
	while(j<=right) {
		if(arr[j]<pivot) {
			int tmp=arr[i];
			arr[i]=arr[j];
			arr[j]=tmp;
			i++;
		}
		j++;
	}
	int tmp=arr[left];
	arr[left]=arr[i-1];
	arr[i-1]=tmp;
	quickSort2(arr,left,i-2);
	quickSort2(arr,i,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
void merge(int arr[],int low,int mid,int high,int* tmp)
{
	int i=low,j=mid+1,k=low;
	while(i<=mid&&j<=high) {
		tmp[k++]=arr[i]<arr[j]?arr[i++]:arr[j++];
	}
	while(i<=mid) {
		tmp[k++]=arr[i++];
	}
	while(j<=high) {
		tmp[k++]=arr[j++];
	}
	for(i=low; i<=high; i++) {
		arr[i]=tmp[i];
	}
}

void merge_sort(int arr[],int low,int high,int* tmp)
{
	if(low>=high) {
		return;
	}
	int mid=low+(high-low)/2;
	merge_sort(arr,low,mid,tmp);
	merge_sort(arr,mid+1,high,tmp);
	merge(arr,low,mid,high,tmp);
}

void mergeSort(int arr[],int length)
{
	int* tmp=(int*)malloc(sizeof(int)*length);
	assert(tmp);
	merge_sort(arr,0,length-1,tmp);
	free(tmp);
}

堆排序

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
typedef struct Heap {
	int* root;
	int length;
} Heap;

Heap* createHeap(int length)
{
	Heap* heap=(Heap*)malloc(sizeof(Heap));
	assert(heap);
	heap->length=0;
	heap->root=(int*)malloc(sizeof(int)*length);
	assert(heap->root);
	return heap;
}

void pushHeap(Heap* heap,int data)
{
	int current=heap->length++;
	int parent=(current-1)/2;
	heap->root[current]=data;
	while(current) {
		if(heap->root[current]<heap->root[parent]) {
			int tmp=heap->root[current];
			heap->root[current]=heap->root[parent];
			heap->root[parent]=tmp;
			current=parent;
			parent=(parent-1)/2;
		}
		else {
			break;
		}
	}
}

int popHeap(Heap* heap)
{
	int val=heap->root[0];
	int current=0;
	int lchild=1;
	heap->root[0]=heap->root[--heap->length];
	while(lchild<heap->length) {
		int small=heap->root[lchild]<heap->root[lchild+1]?lchild:lchild+1;
		if(heap->root[small]<heap->root[current]) {
			int tmp=heap->root[small];
			heap->root[small]=heap->root[current];
			heap->root[current]=tmp;
			current=small;
			lchild=2*current+1;
		}
		else {
			break;
		}
	}
	return val;
}

void heapSort(int arr[],int length)
{
	Heap* heap=createHeap(MAXSIZE);
	for(int i=0; i<MAXSIZE; i++) {
		pushHeap(heap,arr[i]);
	}
	for(int i=0; i<MAXSIZE; i++) {
		arr[i]=popHeap(heap);
	}
}
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
void heapify(int arr[],int length,int current)
{
	int lchild=2*current+1;
	while(lchild<length) {
		int large=lchild==length-1?lchild:(arr[lchild]>arr[lchild+1]?lchild:lchild+1);
		if(arr[large]>arr[current]) {
			int tmp=arr[large];
			arr[large]=arr[current];
			arr[current]=tmp;
			current=large;
			lchild=2*current+1;
		}
		else {
			break;
		}
	}
}

void heapSort2(int arr[],int length)
{
	int current=(length-2)/2;
	while(current>=0) {
		heapify(arr,length,current);
		current--;
	}
	while(length>0) {
		int tmp=arr[0];
		arr[0]=arr[length-1];
		arr[length-1]=tmp;
		heapify(arr,--length,0);
	}
}

计数排序

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
void countSort(int arr[],int length)
{
	int max=arr[0],min=arr[0];
	for(int i=0; i<length; i++) {
		if(arr[i]>max) {
			max=arr[i];
		}
		if(arr[i]<min) {
			min=arr[i];
		}
	}
	int count=max-min+1;
	int* arrs=(int*)calloc(count,sizeof(int));
	for(int i=0; i<length; i++) {
		arrs[arr[i]-min]++;
	}
	for(int i=0,j=0; i<count; i++) {
		while(arrs[i]--) {
			arr[j++]=i+min;
		}
	}
}

基数排序

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
void radixSort(int arr[],int length)
{
	int max=arr[0];
	for(int i=0; i<length; i++) {
		if(arr[i]>max) {
			max=arr[i];
		}
	}
	int* tmp[10];
	for(int i=0; i<10; i++) {
		tmp[i]=(int*)calloc(length+1,sizeof(int));
	}
	for(int idx=1; max/idx>0; idx*=10) {
		int pos,pos2;
		for(int i=0; i<length; i++) {
			pos=arr[i]/idx%10;
			pos2=++tmp[pos][0];
			tmp[pos][pos2]=arr[i];
		}
		pos=0;
		for(int i=0; i<10; i++) {
			for(int j=1; j<=tmp[i][0]; j++) {
				arr[pos++]=tmp[i][j];
				tmp[i][j]=0;
			}
			tmp[i][0]=0;
		}
	}
}