-
Notifications
You must be signed in to change notification settings - Fork 0
/
Counting_sort.cpp
65 lines (58 loc) · 1.13 KB
/
Counting_sort.cpp
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
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
using namespace std;
void counting_sort(int entry[],int out[],int sizis)
{
int histogram[100];
for(int i = 0; i < 100; i ++)
{
histogram[i] = 0;
}
for(int i = 0; i < sizis; i ++)
{
histogram[entry[i]] = histogram[entry[i]] + 1;
}
for(int i = 0; i < 100; i ++)
{
// if(numbers[i])
cout<<histogram[i]<<" ";
}
for(int i = 1; i < 100; i ++)
{
histogram[i] = histogram[i] + histogram[i - 1];
}
for(int i = sizis - 1; i >= 0; i --)
{
out[histogram[entry[i]]] = entry[i];
histogram[entry[i]] = histogram[entry[i]] - 1;
}
}
int main(void)
{
int T = 0;
cin >> T;
int A[T],B[T];
for(int i = 0; i < T; i ++)
{
cin>>A[i];
}
counting_sort(A,B,T);
/* for(int i = 0; i < T; i ++)
{
cout<<B[i]<<" ";
}*/
}