forked from Harshita-Kanal/Data-Structures-and-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
count_sort.cpp
46 lines (37 loc) · 1.1 KB
/
count_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
// C++ Program for counting sort
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define RANGE 255
// This is the main function that sort the given string arr[] in alphabatical order
void countSort(char arr[])
{
// The output character array ehich will contain the sorted array
char output[strlen(arr)];
// Creating a count array to store count
// initialising the count array 0
int count[RANGE + 1], i;
memset(count, 0, sizeof(count));
// Storing the count for each character
for (i = 0; arr[i]; ++i)
++count[arr[i]];
// Change count[i] so that count[i] now contains actual position of this character in output array
for (i = 1; i <= RANGE; ++i)
count[i] += count[i - 1];
// Output character array
for (i = 0; arr[i]; ++i) {
output[count[arr[i]] - 1] = arr[i];
--count[arr[i]];
}
// Copy the output array to arr, so that arr now contains sorted charactor
for (i = 0; arr[i]; ++i)
arr[i] = output[i];
}
// Main Driving Code
int main()
{
char arr[] = "defgcbjsnauy";
countSort(arr);
cout << "Sorted character array is " << arr;
return 0;
}