package sorts;
public class FJQuickSort_MINE extends GenericSortAlgorithm {
// Threshold for switching to sequential execution (tune as needed)
private static final int THRESHOLD = 50000;
public FJQuickSort_MINE() {
}
public FJQuickSort_MINE(int[] array, int left, int right) {
super(array, left, right);
}
@Override
public String getName() {
return "FJ QS";
}
@Override
protected void compute() {
// TODO #3
// Implement the fancy parallel version of quicksort
// that uses prefix/pack partitioning
// Make sure to use a reasonable sequential cutoff (THRESHOLD)
// Change the THRESHOLD value to experiment with performance
// You will most certainly need to create additional methods
// Remember to use fork/join as appropriate.
// You can also use invokeAll() to fork multiple tasks.
}
}