+/EE360P

distributed systems

git clone https://git.julia.blue/+/EE360P

Joseph RyanAdd quicksort807e2fc

master
1.8 KiB62 linesraw
1import java.util.Arrays;
2import java.util.Random;
3
4public class SortTest {
5    public static void main(String[] args) {
6        int[] A1 = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
7        verifyParallelSort(A1);
8
9        int[] A2 = {1, 3, 5, 7, 9};
10        verifyParallelSort(A2);
11
12        int[] A3 = {13, 59, 24, 18, 33, 20, 11, 11, 13, 50, 10999, 97};
13        verifyParallelSort(A3);
14
15        int len = 100;
16        int[] A4 = new Random().ints(len, 0, len).toArray();
17        verifyParallelSort(A4);
18    }
19
20    static void verifyParallelSort(int[] A) {
21        int[] B = new int[A.length];
22        System.arraycopy(A, 0, B, 0, A.length);
23
24        System.out.println("Verify Parallel Sort for array: ");
25        printArray(A);
26
27        Arrays.sort(A);
28        PSort.parallelSort(B, 0, B.length);
29
30        boolean isSuccess = true;
31        for (int i = 0; i < A.length; i++) {
32            if (A[i] != B[i]) {
33                System.out.println(
34                    "Your parallel sorting algorithm is not correct");
35                System.out.println("Expect:");
36                printArray(A);
37                System.out.println("Your results:");
38                printArray(B);
39                isSuccess = false;
40                break;
41            }
42        }
43
44        if (isSuccess) {
45            System.out.println(
46                "Great, your sorting algorithm works for this test case");
47        }
48        System.out.println(
49            "=========================================================");
50    }
51
52    public static void printArray(int[] A) {
53        for (int i = 0; i < A.length; i++) {
54            if (i != A.length - 1) {
55                System.out.print(A[i] + " ");
56            } else {
57                System.out.print(A[i]);
58            }
59        }
60        System.out.println();
61    }
62}