Quicksort Parallel Partitioner

From CSE231 Wiki
Revision as of 14:16, 28 May 2018 by Cosgroved (talk | contribs) (Created page with "==(Optional) Parallel Partition Challenge== The partitioning step can also be done in [http://www.classes.cec.wustl.edu/~cse341/web/handouts/lecture07.pdf parallel with scan]....")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Correctness

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