Beispiel #1
0
        public static void Main(string[] args)
        {
            MergeSort sortArray = new MergeSort(10);

            Console.WriteLine("Unsorted:  {0}", sortArray);

            sortArray.Sort();

            Console.WriteLine("Sorted:  {0}", sortArray);
            //Console.WriteLine("Hello World!");
        }
Beispiel #2
0
        public void TestMethod7()
        {
            List <int> input = new List <int> {
                2, 1
            };
            List <int> expected = new List <int> {
                1, 2
            };

            input = MergeSort.MergeSort_Recursive(input);

            CollectionAssert.AreEqual(expected, input);
        }
Beispiel #3
0
        public void TestMethod5()
        {
            const int ItemCount = 1000;

            Random rnd = new Random();

            int[] input = new int[ItemCount];

            for (int i = 0; i < ItemCount; ++i)
            {
                int random = rnd.Next(ItemCount);
                input[i] = random;
            }

            MergeSort.MergeSort_Recursive(input);

            for (int i = 0; i < ItemCount - 1; ++i)
            {
                if (input[i] > input[i + 1])
                {
                    Assert.Fail("input element input[{0}]={1} is greater than input[{2}]={3}", i, input[i], i + 1, input[i + 1]);
                }
            }
        }
Beispiel #4
0
        public void TestMethod11()
        {
            const int ItemCount = 1001;

            Random rnd = new Random();

            List <int> input = new List <int>();

            for (int i = 0; i < ItemCount; ++i)
            {
                int random = rnd.Next(ItemCount);
                input.Add(random);
            }

            input = MergeSort.MergeSort_Recursive(input);

            for (int i = 0; i < ItemCount - 1; ++i)
            {
                if (input[i] > input[i + 1])
                {
                    Assert.Fail("input element input[{0}]={1} is greater than input[{2}]={3}", i, input[i], i + 1, input[i + 1]);
                }
            }
        }