mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
Create Counting_Sort.cpp
This commit is contained in:
parent
16e1bcdb52
commit
70d42cd072
55
Sorting/Counting_Sort.cpp
Normal file
55
Sorting/Counting_Sort.cpp
Normal file
@ -0,0 +1,55 @@
|
||||
#include<iostream>
|
||||
using namespace std;
|
||||
|
||||
int Max(int Arr[], int N){
|
||||
int max = Arr[0];
|
||||
for(int i=1; i<N; i++)
|
||||
if(Arr[i] > max)
|
||||
max = Arr[i];
|
||||
return max;
|
||||
}
|
||||
|
||||
int Min(int Arr[], int N){
|
||||
int min = Arr[0];
|
||||
for(int i=1; i<N; i++)
|
||||
if(Arr[i] < min)
|
||||
min = Arr[i];
|
||||
return min;
|
||||
}
|
||||
|
||||
void Print(int Arr[], int N){
|
||||
for(int i=0; i<N; i++) cout<<Arr[i] <<", ";
|
||||
}
|
||||
|
||||
int *Counting_Sort(int Arr[], int N){
|
||||
|
||||
int max = Max(Arr, N);
|
||||
int min = Min(Arr, N);
|
||||
int *Sorted_Arr = new int[N];
|
||||
|
||||
int *Count = new int[max-min+1];
|
||||
|
||||
for(int i=0; i<N; i++) Count[Arr[i]-min]++;
|
||||
|
||||
for(int i=1; i<(max-min+1); i++) Count[i]+=Count[i-1];
|
||||
|
||||
for(int i=N-1; i>=0; i--){
|
||||
Sorted_Arr[Count[Arr[i]-min]-1] = Arr[i];
|
||||
Count[Arr[i]-min]--;
|
||||
}
|
||||
|
||||
return Sorted_Arr;
|
||||
}
|
||||
|
||||
int main(){
|
||||
|
||||
int Arr[] = {47, 65, 20, 66, 25, 53, 64, 69, 72, 22, 74, 25, 53, 15, 42, 36, 4, 69, 86, 19}, N = 20;
|
||||
int *Sorted_Arr;
|
||||
|
||||
cout<<"\n\tOrignal Array = ";Print(Arr, N);
|
||||
Sorted_Arr = Counting_Sort(Arr, N);
|
||||
cout<<"\n\t Sorted Array = ";Print(Sorted_Arr, N);
|
||||
cout<<endl;
|
||||
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user