-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCountSort.cpp
More file actions
100 lines (75 loc) · 2.05 KB
/
Copy pathCountSort.cpp
File metadata and controls
100 lines (75 loc) · 2.05 KB
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
//
// main.cpp
// CPPCountSort
//
// Created by nullptr on 16/8/17.
// Copyright © 2016年 nullptr. All rights reserved.
//
#include <iostream>
#include <stdlib.h>
using namespace std;
#define GET_ARRAY_LENGTH(array, len) {len = sizeof(array) / sizeof(array[0]);}
const int NUM = 1000;
void countSort(int *arr, int length, int maxNum) {
if (nullptr == arr || NUM <= 0) {
return;
}
int *countArr = (int *)malloc(sizeof(int) * (maxNum + 1));
int *sortedArray = (int *) malloc(sizeof(int) * length);
for (int i = 0; i < maxNum; ++i) {
countArr[i] = 0;
}
for (int i = 0; i < length; ++i) {
countArr[arr[i]]++;
}
for (int i = 1; i <= maxNum; ++i) {
countArr[i] += countArr[i - 1];
}
for (int i = length - 1; i >= 0; i--) {
sortedArray[--countArr[arr[i]]] = arr[i];
}
for (int i = 0; i < length; ++i) {
arr[i] = sortedArray[i];
}
free(countArr);
free(sortedArray);
return;
}
void optimizedCountSort(int *arr, int length, int maxNum) {
if (nullptr == arr || length <= 0) {
return;
}
int *countArr = (int *)malloc(sizeof(int) * (maxNum + 1));
for (int i = 0; i < maxNum; ++i) {
countArr[i] = 0;
}
for (int i = 0; i < length; ++i) {
countArr[arr[i]]++;
}
int j = 0;
for (int i = 0; i <= maxNum; ++i) {
while (countArr[i]--) {
arr[j++] = i;
}
}
free(countArr);
}
void printArray(int *array, int length) {
for (int i = 0; i < length; ++i)
cout << array[i] << " ";
cout << endl;
cout << "---------------------------------------" << endl;
}
int main(int argc, const char * argv[]) {
int Array[NUM];
srand((unsigned)time(nullptr));
for (int i = 0; i < NUM; ++i) {
Array[i] = rand() % 101;
}
printArray(Array, NUM);
countSort(Array, NUM, 100);
printArray(Array, NUM);
optimizedCountSort(Array, NUM, 100);
printArray(Array, NUM);
return 0;
}