Exemplo n.º 1
0
 public void Test2()
 {
     Program.QuickSort QuickSort = new Program.QuickSort();
     QuickSort.ToSort(array2, 0, array2.Length - 1);
     for (int i = 0; i < array2.Length; i++)
     {
         array2[i] = random.Next(-10000, 10000);
     }
     QuickSort.ToSort(array2, 0, array.Length - 1);
 }
Exemplo n.º 2
0
        public void TestOnStandartWorkingOfQuickSort()
        {
            Program.QuickSort QuickSort = new Program.QuickSort();
            Random            random    = new Random();

            int[] array  = { 5, 3, 4, 2, 1 };
            int[] array2 = { 1, 2, 3, 4, 5 };
            QuickSort.ToSort(array, 0, array.Length - 1);
            foreach (var temp in array)
            {
                Console.Write("{0} ", temp);
            }
            CollectionAssert.AreEqual(array2, array);
        }
Exemplo n.º 3
0
        public void TestOnReverseArray()
        {
            Program.QuickSort QuickSort = new Program.QuickSort();
            Random            random    = new Random();

            int[] array = new int[100];
            for (int i = 0; i < array.Length; i++)
            {
                array[i] = i * (-1);
            }
            QuickSort.ToSort(array, 0, array.Length - 1);
            foreach (var temp in array)
            {
                Console.Write("{0} ", temp);
            }
        }