public class MergeSort
private static final Random RNG new Random10982755L;
private static final int LENGTH 524288;
public static void mainString… args
int arr randomIntArray;
long start System.currentTimeMillis;
concurrentMergeSortarr;
long end System.currentTimeMillis;
if !sorteda
System.err.printlnThe final array is not sorted;
System.exit0;
System.out.printf10d numbers: 6d msn, LENGTH, end start;
private static int randomIntArray
int arr new intLENGTH;
for int i 0; i arr.length; i
arri RNG.nextIntLENGTH 10;
return arr;
public static boolean sortedint arr
return !IntStream.range1, arr.length
.mapToObji arri 1 arri
.findFirst.orElsefalse;