Values: -0.0f = 0.0f is true and a Float.NaN The < relation does not provide a total order on all float Sorts the specified array into ascending numerical order. parallelSort public static void parallelSort(float a).parallelSort public static void parallelSort(long a).parallelSort public static void parallelSort(int a).

parallelSort public static void parallelSort(short a).

parallelSort public static void parallelSort(char a).

Parameters: a - the array to be sorted fromIndex - the index of the first element, inclusive, to be sorted toIndex - the index of the last element, exclusive, to be sorted Throws: IllegalArgumentException - if fromIndex > toIndex ArrayIndexOutOfBoundsException - if fromIndex a.length Since: 1.8

Space no greater than the size of the specified range of the original Granularity, then it is sorted using the appropriate Arrays.sort method. If the length of the specified array is less than the minimum The sub-array length reaches a minimum granularity, the sub-array is Implementation Note: The sorting algorithm is a parallel sort-merge that breaks theĪrray into sub-arrays that are themselves sorted and then merged. IfįromIndex = toIndex, the range to be sorted is empty. Inclusive, to the index toIndex, exclusive. The range to be sorted extends from the index fromIndex, Sorts the specified range of the array into ascending numerical order. parallelSort public static void parallelSort(byte a).sort public static void sort(double a).The toIndex ArrayIndexOutOfBoundsException - if fromIndex a.length To be sorted extends from the index fromIndex, inclusive, to Sorts the specified range of the array into ascending order.

Java array swap method