Parallel Partition

(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
methods:	partitionRange
package:	sort.challenge.quick
source folder:	student/src/main/java

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

Testing Your Solution

Correctness

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