public static final <T> void parallelQuickSort(List<T> list, Comparator<T> comparator)
    {
        ForkJoinPool pool = new ForkJoinPool();
        QuickSorter sorter = new QuickSorter(list, 0, list.size()-1, comparator);
        pool.invoke(sorter);
    }
public static final < T > void parallelQuickSort ( List < T > list , Comparator < T > comparator ) { ForkJoinPool pool = new ForkJoinPool ( ) ; QuickSorter sorter = new QuickSorter ( list , 0 , list . size ( ) - 1 , comparator ) ; pool . invoke ( sorter ) ; }
Sort list using quick-sort algorithm using ForkJoinPool.
<p>Note! This is experimental and is slower than other sorting methods!
@param <T>
@param list
@param comparator