Beispiel #1
0
        static void Main(string[] args)
        {
            SortList list = new SortList(10);

            Quicksort.quicksort(list);
            Console.WriteLine(list);
            Console.ReadLine();
        }
        public static void merge(ISortList list, int leftIndex, int middleIndex, int rightIndex)
        {
            int leftSubIndex, rightSubIndex, mergedSubindex;
            int leftSubSize  = middleIndex - leftIndex + 1;
            int rightSubSize = rightIndex - middleIndex;

            // Temporary lists
            ISortList left  = new SortList(leftSubSize);
            ISortList right = new SortList(rightSubSize);

            // Copy data into temp. lists
            for (leftSubIndex = 0; leftSubIndex < leftSubSize; leftSubIndex++)
            {
                left[leftSubIndex] = list[leftIndex + leftSubIndex];
            }

            for (rightSubIndex = 0; rightSubIndex < rightSubSize; rightSubIndex++)
            {
                right[rightSubIndex] = list[middleIndex + 1 + rightSubIndex];
            }

            // Merge temp. lists  back into original
            leftSubIndex   = 0;
            rightSubIndex  = 0;
            mergedSubindex = leftIndex;

            while (leftSubIndex < leftSubSize && rightSubIndex < rightSubSize)
            {
                if (left[leftSubIndex] <= right[rightSubIndex])
                {
                    list[mergedSubindex] = left[leftSubIndex];
                    leftSubIndex++;
                }
                else
                {
                    list[mergedSubindex] = right[rightSubIndex];
                    rightSubIndex++;
                }
                mergedSubindex++;
            }

            // Copy any remainders from the left list
            while (leftSubIndex < leftSubSize)
            {
                list[mergedSubindex] = left[leftSubIndex];
                leftSubIndex++;
                mergedSubindex++;
            }

            // Copy any remainders from the right list
            while (rightSubIndex < rightSubSize)
            {
                list[mergedSubindex] = right[rightSubIndex];
                rightSubIndex++;
                mergedSubindex++;
            }
        }
Beispiel #3
0
        static void Main(string[] args)
        {
            SortList list = new SortList(100);

            Quicksort.quicksort(list);
            // Mergesort.mergesort(list);
            Console.WriteLine("Result: " + list);
            Console.ReadLine();
        }