mirrors
/
TheAlgorithms-C
mirror of https://github.com/TheAlgorithms/C
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #497 from ubc1729/master 

Indented "counting Sort" and fixed compilation errors
This commit is contained in:
Ashwek Swamy 2019-11-09 23:34:53 +05:30 committed by GitHub
parent ebc8fc851f 6159abcff1
commit 70c11c370a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 45 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

72
sorting/countingSort.c
View File

@ -1,28 +1,46 @@
/*
> Counting sort is a sorting technique based on keys between a specific range.
> integer sorting algorithm
> Worst-case performance O(n+k)
> Stabilized by prefix sum array
*/
#include <stdio.h> #include <stdio.h>
int main() #include <string.h>
{
int i,n,l=0; int main()
scanf("%d",&n); {
int a[n]; int i, n, l = 0;
for(i=0;i<n;i++)
{ printf("Enter size of array = ");
scanf("%d",&a[i]); scanf("%d", &n);
if(a[i]>l)
l=a[i]; int a[n];
} printf("Enter %d elements in array :\n", n);
int b[l+1]={0}; for(i = 0; i < n; i++)
for(i=0;i<n;i++) {
b[a[i]]++; //hashing number to array index scanf("%d", &a[i]);
for(i=0;i<(l+1);i++) if(a[i] > l)
{ l = a[i];
if(b[i]>0) }
{
while(b[i]!=0) //for case when number exists more than once int b[l + 1];
{ memset(b, 0, (l + 1) * sizeof(b[0]));
printf("%d ",i);
b[i]--; for(i = 0; i < n; i++)
} b[a[i]]++; //hashing number to array index
}
} for(i = 0; i < (l + 1); i++) //unstable , stabilized by prefix sum array
return 0; {
} if(b[i] > 0)
{
while(b[i] != 0) //for case when number exists more than once
{
printf("%d ", i);
b[i]--;
}
}
}
return 0;
}