基数排序(radix sort)

 #include<iostream>
 #include<ctime>
 #include <stdio.h>
 #include<cstring>
 #include<cstdlib>
 #include <map>
 #include <string>
 using namespace std;
 // A utility function to get maximum value in arr[]
 int getMax(int arr[], int n)
 {
     ];
     ; i < n; i++)
         if (arr[i] > mx)
             mx = arr[i];
     return mx;
 }
 
 // A function to do counting sort of arr[] according to
 // the digit represented by exp.
 void countSort(int arr[], int n, int exp)
 {
     int output[n]; // output array
     ] = {};
 
     // Store count of occurrences in count[]
     ; i < n; i++)
         count[ (arr[i]/exp)% ]++;
 
     // Change count[i] so that count[i] now contains actual position of
     // this digit in output[]
     ; i < ; i++)
         count[i] += count[i-];
 
     // Build the output array
     ; i >= ; i--) {
         output[count[(arr[i]/exp)%]-] = arr[i];
         count[(arr[i]/exp)%]--;
     }
 
     // Copy the output array to arr[], so that arr[] now
     // contains sorted numbers according to curent digit
     ; i < n; i++)
         arr[i] = output[i];
 }
 
 // The main function to that sorts arr[] of size n using Radix Sort
 void radixsort(int arr[], int n)
 {
     // Find the maximum number to know number of digits
     int m = getMax(arr, n);
 
     // Do counting sort for every digit. Note that instead of passing digit
     // number, exp is passed. exp is 10^i where i is current digit number
     ; m/exp > ; exp *= )
         countSort(arr, n, exp);
 }
 
 // A utility function to print an array
 void print(int arr[], int n)
 {
     ; i < n; i++)
         cout << arr[i] << " ";
 }
 #if TEST
 int main(){
     , , , , , , , };
         ]);
         radixsort(arr, n);
         print(arr, n);
 }
 #endif