基数排序

        /// <summary>
        /// 基数排序
        /// 原理：首先按个位数进行排序，再以十位数排序
        /// LSD的排序方式由键值的最右边开始，而MSD则相反，由键值的最左边开始。
        /// </summary>
        /// <param name="v"></param>
        /// <returns></returns>
        public static int[] RadixSort(int[] v)
        {
            int[] temp = new int[10];
            for (int i = 0; i < v.Length; i++)
            {
                int k = v[i] % 10;
                temp[k] = v[i];
            }

            v = getV(temp, v);            

            for (int n = 0; n < v.Length; n++)
            {
                int m = v[n] / 10;
                if (m == 0)
                    m = v[n] % 10;
                temp[m] = v[n];
            }

            v = getV(temp, v);  

            return v;
        }

        /// <summary>
        /// 得到新数组
        /// </summary>
        /// <param name="temp"></param>
        /// <param name="v"></param>
        /// <returns></returns>
        public static int[] getV(int[] temp, int[] v)
        {
            int i = 0;
            for (int j = 0; j < temp.Length; j++)
            {
                if (temp[j] > 0)
                {
                    v[i] = temp[j];
                    temp[j] = 0;
                    i++;
                }
            }

            return v;
        }