Write a Program of Counting Sorting Algorithm in C++.

COUNTING SORT

#include<iostream>

using namespace std;

#include<conio.h>

main()

{

            int a[100],max,b[100],c[100],i,j,n;

            cout<<"Enter number of element:";

            cin>>n;

            cout<<"enter "<<n<<" element:\n";

            for(i=0;i<n;i++)

                        cin>>a[i];

            max=a[0];

            for(i=0;i<n;i++)

            {

                        if(a[i]>max)

                        {

                                    max=a[i];

                        }

            }

            for(j=0;j<max+1;j++)

                        c[j]=0;

            for(j=0;j<n;j++)

                        c[a[j]]=c[a[j]]+1;

            for(int k=1;k<=max+1;k++)

                        c[k]=c[k]+c[k-1];

            for(j=n-1;j>=0;j--)

            {

                        b[c[a[j]]]=a[j];

                        c[a[j]]--;

            }

            cout<<"Sorted Element.....\n";

            for(i=1;i<=n;i++)

                        cout<<b[i]<<endl;

            getch();

}

OUTPUT