Sorting-Algorithms/RadixSort.cpp at master · bishworup11/Sorting-Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include<bits/stdc++.h>
using namespace std;

void CountingSort(int arr[],int n,int pos )
{
    int i ,j,k=9;
    int count[10],b[n];


    for(i=0;i<=k;i++)
    {
        count[i]=0;
    }


    for(i=0;i<n;i++)
    {
        count[(arr[i]/pos)%10]++;

    }

    for(i=1;i<=k;i++)
    {
        count[i]=count[i]+count[i-1];
    }

    for(i=n-1;i>=0;i--)
    {
             b[--count[(arr[i]/pos)%10]]=arr[i];

    }

    for(i=0;i<n;i++)
    {
        arr[i]=b[i];
    }


}

void RadixSort(int arr[],int n,int max)
{
    for (int pos = 1; 0 <(max/pos); pos=pos*10)
    {

        CountingSort(arr,n,pos);
    }
}

void display(int arr[],int n)
{

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

        cout<<arr[i]<<" ";
    }
}

main()
{
    int n,max=0;

    printf("input the array length\n");

    cin>>n;
    int ar[n];
    for(int i=0;i<n;i++)
    {

        cin>>ar[i];
        if(max<ar[i])
        {
            max=ar[i];
        }

    }

   RadixSort(ar,n,max);

    display(ar,n);


}