Radix sort

• r is radix, x%r, (x%r²)∕r, (x%r³)∕r² get each digit from least significant digit (LSD) radix sorts to most significant digit.
  int i ; 
  int k; 
  while(i%10){ 
  k = i%10; 
  i = i/10; 
  }
  1. according to r, prepare two arrays buckets A, B.
  2. Sort according to one position and put them into A array buckets.
  3. loop through A array buckets, and get next position digit. and then according to its value put into B array buckets.
  4. swap A,B two array, then goto step 2.