java - 使用 JavaParallel 进行快速排序

Question

我需要知道如何使用JavaParallel并行化quickSort排序算法的以下代码，或者我推荐algortimo的一些热点来并行化它

public void quickSort (ArrayList<ParElementoValor> paresValores, int begin, int end){

    if (begin < end) {

            int partitionIndex = partition(paresValores, begin, end);
            quickSort(paresValores, begin, partitionIndex-1);
            quickSort(paresValores, partitionIndex+1, end);
                      }  
    }

private int partition(ArrayList<ParElementoValor> paresValores, int begin, int end) {
        ParElementoValor pivot = paresValores.get(end);

        int i = (begin-1);

        for (int j = begin; j < end; j++) {
            if (paresValores.get(j).getSuma() > pivot.getSuma()) {
                i++;

                ParElementoValor swapTemp = paresValores.get(i);
                paresValores.set(i, paresValores.get(j));
                paresValores.set(j, swapTemp);

                                                                  }
                                           }

        ParElementoValor swapTemp = paresValores.get(i+1);
         paresValores.set(i+1, paresValores.get(end));
         paresValores.set(end, swapTemp);

        return i+1;
    }

Answer 1

您可以使用与此类问题完全匹配的ForkJoinPool

有很多例子，例如

https://gist.github.com/EliaRohana/25b924048d990c5358313d18daf8f491

http://www.java2s.com/Tutorials/Java/Java_Thread_How_to/Concurrent/Do_quick_sort_with_ForkJoinPool_and_RecursiveAction.htm