基数排序算法LSD实现

基数排序算法的实质是用的分类的方式。
LSD 按低位开始分类，
其实在按各位进行分类的时候就已经注定了 相同位数的数的相对大小关系了。
lsd实现如下：

#include <iostream>
#include <windows.h>
#include <algorithm>
#include <cmath>

int GetMaxValue(int* array, int length)
{
  int maxValue = array[0];
  for (int i = 1; i < length; i++)
  {
    if (maxValue < array[i])
    {
      maxValue = array[i];
    }
  }
  return maxValue;
}

int GetMaxdigitBit(int value)
{
  int bitCount = 1;
  while (value / (int)pow(10, bitCount) != 0)
  {
    bitCount++;
  }

  return bitCount;
}

void Sort(int* array, int length, int ditinum)
{
  int bucketCol[10] = {};
  int *(*bucket) = new int*[10];
  for (int i = 0; i < 10; i++)
  {
    bucket[i] = new int[length];
  }

  for (int i = 0; i < length; i++)
  {
    int rowIndex = array[i] % (int)pow(10, ditinum) / pow(10, ditinum - 1);
    int column = bucketCol[rowIndex];
    bucket[rowIndex][column] = array[i];
    bucketCol[rowIndex]++;
  }

  //写回原数组
  int rowIndex = 0;
  int columnIndex = 0;
  int arrayIndex = 0;
  for (int i = 0; i < 10; i++)
  {
    int indexCol = 0;
    while (bucketCol[i]-- > 0)
    {
      std::cout << "cur row:" << i << std::endl;
      int tmp = bucket[i][indexCol++];
      std::cout << tmp << std::endl;
      array[arrayIndex++] = tmp;
    }
  }

  for (int i = 0; i < 10; i++)
  {
    delete[] bucket[i];
  }

  delete[] bucket;

  std::for_each(array, array + length, [](int i) {
    std::cout << i << " ";
    });

  std::cout << std::endl;
}

void LSDSort(int* array, int length)
{
  //1 获取最大数
  int maxValue = GetMaxValue(array, length);
  //2 获取最大的位数
  int bitNum = GetMaxdigitBit(maxValue);
  //3 
  for (int i = 1; i <= bitNum; i++)
  {
    std::cout << "cur bit:" << i << std::endl;
    Sort(array, length, i);
  }
}

int main()
{
  int array[] = { 12,31,1,21,11,3,89,56,14,89,10,2 };
  int length = sizeof(array) / sizeof(array[0]);
  LSDSort(array, length);
  std::for_each(array, array + length, [](int i) {
    std::cout << i << " ";
    });
    
  std::cout << std::endl;
  return 0;
}