backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-14 10:50:13 +08:00
Code Issues Projects Releases Wiki Activity

formatting source-code for 153fb7b8a5

Browse Source
This commit is contained in:
github-actions
2020-05-30 04:02:09 +00:00
parent 92fe9495ec
commit 8a2de9842b
175 changed files with 1671 additions and 3460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
sorting/counting_sort.cpp
View File

@@ -1,8 +1,7 @@
#include <iostream>
using namespace std;
int Max(int Arr[], int N)
{
int Max(int Arr[], int N) {
int max = Arr[0];
for (int i = 1; i < N; i++)
if (Arr[i] > max)
@@ -10,8 +9,7 @@ int Max(int Arr[], int N)
return max;
}
int Min(int Arr[], int N)
{
int Min(int Arr[], int N) {
int min = Arr[0];
for (int i = 1; i < N; i++)
if (Arr[i] < min)
@@ -19,13 +17,11 @@ int Min(int Arr[], int N)
return min;
}
void Print(int Arr[], int N)
{
void Print(int Arr[], int N) {
for (int i = 0; i < N; i++) cout << Arr[i] << ", ";
}
int *Counting_Sort(int Arr[], int N)
{
int *Counting_Sort(int Arr[], int N) {
int max = Max(Arr, N);
int min = Min(Arr, N);
int *Sorted_Arr = new int[N];
@@ -36,8 +32,7 @@ int *Counting_Sort(int Arr[], int N)
for (int i = 1; i < (max - min + 1); i++) Count[i] += Count[i - 1];
for (int i = N - 1; i >= 0; i--)
{
for (int i = N - 1; i >= 0; i--) {
Sorted_Arr[Count[Arr[i] - min] - 1] = Arr[i];
Count[Arr[i] - min]--;
}
@@ -45,8 +40,7 @@ int *Counting_Sort(int Arr[], int N)
return Sorted_Arr;
}
int main()
{
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;