Max(
intArr[],
intN) {
6 for(
inti = 1; i < N; i++)
12intMin(
intArr[],
intN) {
14 for(
inti = 1; i < N; i++)
20voidPrint(
intArr[],
intN) {
21 for(
inti = 0; i < N; i++) cout << Arr[i] <<
", ";
24int*Counting_Sort(
intArr[],
intN) {
25 intmax = Max(Arr, N);
26 intmin = Min(Arr, N);
27 int*Sorted_Arr =
new int[N];
29 int*Count =
new int[max - min + 1];
30 for(
inti = 0; i < max - min + 1; ++i) {
34 for(
inti = 0; i < N; i++) Count[Arr[i] - min]++;
36 for(
inti = 1; i < (max - min + 1); i++) Count[i] += Count[i - 1];
38 for(
inti = N - 1; i >= 0; i--) {
39Sorted_Arr[Count[Arr[i] - min] - 1] = Arr[i];
40Count[Arr[i] - min]--;
48 intArr[] = {47, 65, 20, 66, 25, 53, 64, 69, 72, 22,
4974, 25, 53, 15, 42, 36, 4, 69, 86, 19},
53cout <<
"\n\tOrignal Array = ";
55Sorted_Arr = Counting_Sort(Arr, N);
56cout <<
"\n\t Sorted Array = ";
int main()
Main function.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4