Radix Sort

[mherald81]

I'm trying to implement radix sort into my program. Radix sort should take as input 2 parameters, RANGE and BASE. RANGE will be the highest value of integer that will be in the sorting data, and BASE will be an adjustable parameter that effects the efficiency of Radix sort.

This is what I have so far.

void radixSort(vector<int>& a, int base)
{
  int const MAX = 10;
  static vector<int> buckets[MAX];
  int pow = 1;
  
  for (int i = 0; i < MAX; ++i)
  {
    buckets[i].resize(a.size());
    buckets[i][0] = 0;
  }

  for (int i = 0; i < base; ++i, pow *= 10)
  {
    for (int j = 0; j < MAX; ++j)
    {
      buckets[j][0] = 0;
    }

    for (int j = 0; j < a.size(); ++j)
    {
      int index = (a[j] / pow) % 10;
      buckets[index][++buckets[index][0]] = a[j];
    }
      
    int cnt = 0;
    for (int j = 0; j < MAX; ++j)
    {
      for (int k = 0; k < buckets[j][0]; ++k)
      {
        a[cnt++] = buckets[j][k + 1];
      }
    }
  } 
}

I appreciate any help on this little problem.

[Zaita]

Have a read through:
http://en.wikipedia.org/wiki/Radix_sort

[mherald81]

Well it sorts when base is 9. I'm just not sure how to implement the base paremeter into my function so that it changes the efficiency of the program but still sort the numbers.