-
Notifications
You must be signed in to change notification settings - Fork 88
/
CountSort.c
99 lines (86 loc) · 1.73 KB
/
CountSort.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
#include<stdio.h>
#include<limits.h>
#include<stdlib.h>
void printArray(int *a, int n)
{
for (int i = 0; i < n; i++)
{
printf("%d ",a[i]);
}
printf("\n");
}
int maximum(int *a, int n)
{
int max = INT_MIN;
for (int i = 0; i < n; i++)
{
if(a[i] > max)
{
max = a[i];
}
}
return max;
}
void CountSort(int *a, int n)
{
int i,j;
// Find the maximum element in the array
int max = maximum(a,n);
// Create the count array dynamically
int* count = (int*) malloc((max+1)*sizeof(int));
// Initialize the array with 0
for (i = 0; i < max+1; i++)
{
count[i] = 0;
}
// Increment the corresponding index in the count array
for (i = 0; i < n; i++)
{
count[a[i]] = count[a[i]] + 1;
}
i = 0; // counter for count array
j = 0; // counter for given array
while (i<=max)
{
if(count[i]>0)
{
a[j] = i;
count[i] = count[i] - 1;
j++;
}
else
{
i++;
}
}
}
int main()
{
int n,a[100];
printf("Enter the size of the array: ");
scanf("%d",&n);
printf("Enter the elements of the array: ");
for (int i = 0; i < n; i++)
{
scanf("%d",&a[i]);
}
printf("Array before Count Sort: ");
printArray(a,n);
CountSort(a,n);
printf("Array after Count Sort: ");
printArray(a,n);
return 0;
}
/* OUTPUT:
Enter the size of the array: 8
Enter the elements of the array: 2
4
2
9
4
11
6
17
Array before Count Sort: 2 4 2 9 4 11 6 17
Array after Count Sort: 2 2 4 4 6 9 11 17
*/