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