Quicksort Parallel Partitioner

From CSE231 Wiki
Jump to: navigation, search

(Optional) Parallel Partition Challenge

The partitioning step can also be done in parallel with scan. While not particularly practical, it can get the CPL down to \mathcal{O}(\lg^k{}n).

class: ParallelPartitioner.java Java.png
methods: partitionRange
package: sort.challenge.quick
source folder: src/main/java

method: PivotLocation partitionRange(int[] data, int min, int maxExclusive) Parallel.svg (parallel implementation required)

Testing Your Solution


class: ParallelPartitionerTestSuite.java Junit.png
package: sort.challenge.quick
source folder: src/test/java