Skip to content

Counting_sort implementation in C #32

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
aman05382 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Counting_sort implementation in C #32

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
33 changes: 33 additions & 0 deletions Countingsort.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
#include<stdio.h>

void counting_sort(int a[],int n,int max)
{
int count[50]={0},i,j;

for(i=0;i<n;++i)
count[a[i]]=count[a[i]]+1;

printf("\nSorted elements are:");

for(i=0;i<=max;++i)
for(j=1;j<=count[i];++j)
printf("%d ",i);
}

int main()
{
int a[50],n,i,max=0;
printf("Enter number of elements:");
scanf("%d",&n);
printf("\nEnter elements:");

for(i=0;i<n;++i)
{
scanf("%d",&a[i]);
if(a[i]>max)
max=a[i];
}

counting_sort(a,n,max);
return 0;
}