14. Parallel Array Sorting with Java 8 | How Parallel Array Sort works with example programs

Algorithm of parallelSort():
1. The array is divided into sub-arrays and that sub-arrays is again divided into their sub-arrays, until the minimum level of detail in a set of array.
2. Arrays are sorted individually by multiple thread.
3. The parallel sort uses Fork/Join Concept for sorting.
4. Sorted sub-arrays are then merged.
Syntax:
- For sorting data in ascending order : public static void parallelSort(Object obj[])
- sorting data in specified range in ascending order : public static void parallelSort(Object obj[], int from, int to)
Advantage : parallelSort() method uses concept of MultiThreading which makes the sorting faster as compared to normal sorting method.