Java Arrays parallelSort(byte[] a) Method

---

---

Description

The Java Arrays parallelSort(byte[] a) method sorts the specified array of bytes into ascending numerical order. This method using a parallel sort-merge algorithm which breaks the array into subarrays, sorted them and then merged to give a sorted array.

Declaration

Following is the declaration for java.util.Arrays.parallelSort(byte[] a) method

public static void parallelSort(byte[] a)

Parameters

a − This is the array to be sorted.

Return Value

This method does not return any value.

Exception

NA

Java Arrays parallelSort(byte[] a, int fromIndex, int toIndex) Method

Description

The Java Arrays parallelSort(byte[] a, int fromIndex, int toIndex) method sorts the specified range of given array of bytes into ascending numerical order. This method using a parallel sort-merge algorithm which breaks the array into subarrays, sorted them and then merged to give a sorted array.

Declaration

Following is the declaration for java.util.Arrays.parallelSort(byte[] a, int fromIndex, int toIndex) method

public static void parallelSort(byte[] a, int fromIndex, int toIndex)

Parameters

• a − This is the array to be sorted.

• fromIndex − This is the index of the first element, inclusive, to be sorted.

• toIndex − This is the index of the last element, exclusive, to be sorted

Return Value

This method is not returning anything.

Exception

• IllegalArgumentException − if fromIndex > toIndex

• ArrayIndexOutOfBoundsException − if fromIndex < 0 or toIndex > array.length

Sorting an Array of bytes Example

The following example shows the usage of Java Arrays parallelSort(byte[]) method. First, we've created an array of bytes, printed the original array. Using parallelSort() method, array is sorted and printed thereafter.

package com.tutorialspoint;

import java.util.Arrays;

public class ArrayDemo {
   public static void main(String[] args) {
      // initialize unsorted array
      byte arr[] = { 11, 54, 23, 32, 15, 24, 31, 12 };

      System.out.print("Original Array: [");
      // print the array
      for (int i = 0; i < arr.length; i++) {
         System.out.print(arr[i] + " ");
      }
      System.out.println("]");
     
      // sort the array
      Arrays.parallelSort(arr);

      System.out.print("Sorted Array: [");
      // print the array
      for (int i = 0; i < arr.length; i++) {
         System.out.print(arr[i] + " ");
      }
      System.out.println("]");
   }
}

Output

Let us compile and run the above program, this will produce the following result −

Original Array: [11 54 23 32 15 24 31 12 ]
Sorted Array: [11 12 15 23 24 31 32 54 ]

Sorting an Array of bytes with a Range Example

The following example shows the usage of Java Arrays parallelSort(byte[], int, int) method. First, we've created an array of bytes, printed the original array. Using parallelSort() method, array is sorted and printed thereafter.

package com.tutorialspoint;

import java.util.Arrays;

public class ArrayDemo {
   public static void main(String[] args) {
      // initialize unsorted array
      byte arr[] = { 11, 54, 23, 32, 15, 24, 31, 12 };

      System.out.print("Original Array: [");
      // print the array
      for (int i = 0; i < arr.length; i++) {
         System.out.print(arr[i] + " ");
      }
      System.out.println("]");
     
      // sort the array
      Arrays.parallelSort(arr, 0, arr.length);

      System.out.print("Sorted Array: [");
      // print the array
      for (int i = 0; i < arr.length; i++) {
         System.out.print(arr[i] + " ");
      }
      System.out.println("]");
   }
}

Output

Let us compile and run the above program, this will produce the following result −

Original Array: [11 54 23 32 15 24 31 12 ]
Sorted Array: [11 12 15 23 24 31 32 54 ]

Sorting a Sub-Array of bytes Example

The following example shows the usage of Java Arrays parallelSort(byte[], int, int) method. First, we've created an array of bytes, printed the original array. Using parallelSort() method, a sub-array is sorted and printed thereafter.

package com.tutorialspoint;

import java.util.Arrays;

public class ArrayDemo {
   public static void main(String[] args) {
      // initialize unsorted array
      byte arr[] = { 11, 54, 23, 32, 15, 24, 31, 12 };

      System.out.print("Original Array: [");
      // print the array
      for (int i = 0; i < arr.length; i++) {
         System.out.print(arr[i] + " ");
      }
      System.out.println("]");
     
      // sort first five elements of the array 
      Arrays.parallelSort(arr, 0, 5);

      System.out.print("Sorted Array: [");
      // print the array
      for (int i = 0; i < arr.length; i++) {
         System.out.print(arr[i] + " ");
      }
      System.out.println("]");
   }
}

Output

Let us compile and run the above program, this will produce the following result −

Original Array: [11 54 23 32 15 24 31 12 ]
Sorted Array: [11 15 23 32 54 24 31 12 ]