radixsorter.cs

Data Structures and Algorithms with Object-Oriented Design Patterns in C# 这本书的范例代码dll自己反编译的source

namespace Opus6
{
    using System;

    [Copyright("Copyright (c) 2001 by Bruno R. Preiss, P.Eng."), Version("$Id: RadixSorter.cs,v 1.3 2001/09/11 12:04:04 brpreiss Exp $")]
    public class RadixSorter : AbstractSorter
    {
        public RadixSorter()
        {
            this.count = new int[0x100];
        }

        public static void Main()
        {
            AbstractSorter.TestSorter(new RadixSorter(), 0x186a0, 0x7b);
        }

        protected override void Sort()
        {
            ComparableObject[] objArray1 = new ComparableObject[base.n];
            for (int num1 = 0; num1 < 4; num1++)
            {
                int[] numArray1;
                int num9;
                for (int num2 = 0; num2 < 0x100; num2++)
                {
                    this.count[num2] = 0;
                }
                for (int num3 = 0; num3 < base.n; num3++)
                {
                    (numArray1 = this.count)[num9 = (((int) base.array[num3]) >> ((8 * num1) & 0x1f)) & 0xff] = numArray1[num9] + 1;
                    objArray1[num3] = base.array[num3];
                }
                int num4 = 0;
                for (int num5 = 0; num5 < 0x100; num5++)
                {
                    int num6 = num4;
                    num4 += this.count[num5];
                    this.count[num5] = num6;
                }
                for (int num7 = 0; num7 < base.n; num7++)
                {
                    int num10;
                    int num8 = (((int) objArray1[num7]) >> ((8 * num1) & 0x1f)) & 0xff;
                    (numArray1 = this.count)[num9 = num8] = (num10 = numArray1[num9]) + 1;
                    base.array[num10] = objArray1[num7];
                }
            }
        }


        protected int[] count;
        protected const int p = 4;
        protected const int r = 8;
        protected const int R = 0x100;
    }
}