radix sort in c 2b 2b

1#include <iostream> 
2using namespace std; 
3  
4
5int getMax(int arr[], int n) 
6{ 
7    int mx = arr[0]; 
8    for (int i = 1; i < n; i++) 
9        if (arr[i] > mx) 
10            mx = arr[i]; 
11    return mx; 
12} 
13  
14
15void countSort(int arr[], int n, int exp) 
16{ 
17    int output[n]; 
18    int i, count[10] = { 0 }; 
19  
20    
21    for (i = 0; i < n; i++) 
22        count[(arr[i] / exp) % 10]++; 
23  
24   
25    for (i = 1; i < 10; i++) 
26        count[i] += count[i - 1]; 
27  
28 
29    for (i = n - 1; i >= 0; i--) { 
30        output[count[(arr[i] / exp) % 10] - 1] = arr[i]; 
31        count[(arr[i] / exp) % 10]--; 
32    } 
33  
34    for (i = 0; i < n; i++) 
35        arr[i] = output[i]; 
36} 
37  
38
39
40void radixsort(int arr[], int n) 
41{ 
42
43    int m = getMax(arr, n); 
44  
45   
46    for (int exp = 1; m / exp > 0; exp *= 10) 
47        countSort(arr, n, exp); 
48} 
49  
50
51void print(int arr[], int n) 
52{ 
53    for (int i = 0; i < n; i++) 
54        cout << arr[i] << " "; 
55} 
56  
57
58int main() 
59{ 
60    int arr[] = { 170, 45, 75, 90, 802, 24, 2, 66 }; 
61    int n = sizeof(arr) / sizeof(arr[0]); 
62      
63
64      radixsort(arr, n); 
65    print(arr, n); 
66    return 0; 
67}