text: // The MIT License (MIT)
  
  // Copyright (c) 2019 OSS_G6. All rights reserved.
  
  // Permission is hereby granted, free of charge, to any person obtaining a copy
  // of this software and associated documentation files (the "Software"), to deal
  // in the Software without restriction, including without limitation the rights
  // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  // copies of the Software, and to permit persons to whom the Software is
  // furnished to do so, subject to the following conditions:
  
  // The above copyright notice and this permission notice shall be included in
  // all copies or substantial portions of the Software.
  
  // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  // THE SOFTWARE.
  
  #ifndef RADIX_H_INCLUDED
  #define RADIX_H_INCLUDED
  
  #include <queue>
  
  void radix(int arr[], int size){
  	int tmp[size];
  	std::queue<int> radix[10];
  
  	int max = arr[0];
  	int d = 1;
  	int mod = 10;
  	int dMin = 1;
  	for(int i = 1 ; i < size ; i++)
  		if(max < arr[i]) max = arr[i];
  
  	while(max/10){
  		d *= 10;
  		max /= 10;
  	}
  
  	while(dMin <= d){
  		for (int i = 0 ; i < size ; i++)
  			radix[(arr[i] % mod)/dMin].push(arr[i]);
  		for(int i = 0, j = 0; i < 10 ;){
  			if(radix[i].size()){
  				arr[j++] = radix[i].front();
  				radix[i].pop();
  			}
  			else i++;
  		}
  		dMin *= 10;
  		mod *= 10;
  	}
  }
  
  #endif