Provided

import org.junit.Assert;

import org.junit.jupiter.api.Test;

class QuickSortNonRecursiveTest {

@Test

void testSortI_1() {

Character[] a = {'b'};

QuickSortNonRecursive.sort(a);

Assert.assertTrue(SortUtils.isNonDecreasingOrder(a));

}

@Test

void testSortI_2() {

Integer[] a = {2, 1};

QuickSortNonRecursive.sort(a);

Assert.assertTrue(SortUtils.isNonDecreasingOrder(a));

}

@Test

void testSortI_3() {

Integer[] a = {1, 2};

QuickSortNonRecursive.sort(a);

Assert.assertTrue(SortUtils.isNonDecreasingOrder(a));

}

@Test

void testSortI_4() {

String[] a = {"1", "3", "2"};

QuickSortNonRecursive.sort(a);

Assert.assertTrue(SortUtils.isNonDecreasingOrder(a));

}

}

QuickSortRandomized uses two methods to do quick sort. The first method shuffles the input array before doing regular quick sort. The second method randomly picks a pivot element during each partition. Run QuickSoxtRandomizedTest five times and provide the results in the following table. From your experiments, which method runs faster? Average Method1 DurationAverage Method 2 Duration 1000 10000 100000 1000000 10000000 QuickSortRandomized uses two methods to do quick sort. The first method shuffles the input array before doing regular quick sort. The second method randomly picks a pivot element during each partition. Run QuickSoxtRandomizedTest five times and provide the results in the following table. From your experiments, which method runs faster? Average Method1 DurationAverage Method 2 Duration 1000 10000 100000 1000000 10000000