-
Notifications
You must be signed in to change notification settings - Fork 0
/
102-counting_sort.c
68 lines (58 loc) · 1.29 KB
/
102-counting_sort.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
#include "sort.h"
/**
* get_max - Get the maximum value in an array of integers.
* @array: An array of integers.
* @size: The size of the array.
*
* Return: The maximum integer in the array.
*/
int get_max(int *array, int size)
{
int max, i;
for (max = array[0], i = 1; i < size; i++)
{
if (array[i] > max)
max = array[i];
}
return (max);
}
/**
* counting_sort - Sort an array of integers in ascending order
* using the counting sort algorithm.
* @array: An array of integers.
* @size: The size of the array.
*
* Description: Prints the counting array after setting it up.
*/
void counting_sort(int *array, size_t size)
{
int *count, *sorted, max, i;
if (array == NULL || size < 2)
return;
sorted = malloc(sizeof(int) * size);
if (sorted == NULL)
return;
max = get_max(array, size);
count = malloc(sizeof(int) * (max + 1));
if (count == NULL)
{
free(sorted);
return;
}
for (i = 0; i < (max + 1); i++)
count[i] = 0;
for (i = 0; i < (int)size; i++)
count[array[i]] += 1;
for (i = 0; i < (max + 1); i++)
count[i] += count[i - 1];
print_array(count, max + 1);
for (i = 0; i < (int)size; i++)
{
sorted[count[array[i]] - 1] = array[i];
count[array[i]] -= 1;
}
for (i = 0; i < (int)size; i++)
array[i] = sorted[i];
free(sorted);
free(count);
}