ParallelQuickSort class
Parallel Quick Sort with work-stealing pattern
Features:
- Parallel partitioning and recursive sorting
- Load balancing across cores
- Hybrid approach: switches to insertion sort for small subarrays
- Randomized pivot selection for better average performance
Best for: Large unsorted datasets, good cache locality needed
Constructors
Properties
- hashCode → int
-
The hash code for this object.
no setterinherited
- meta → AlgoMetadata
-
Metadata describing this strategy's characteristics and requirements
no setteroverride
- runtimeType → Type
-
A representation of the runtime type of the object.
no setterinherited
Methods
-
canApply(
List< int> input, SelectorHint hint) → bool -
Fast check if this strategy can be applied to the given input and hint.
override
-
execute(
List< int> input) → List<int> -
Execute the algorithm on the given input.
override
-
noSuchMethod(
Invocation invocation) → dynamic -
Invoked when a nonexistent method or property is accessed.
inherited
-
toString(
) → String -
A string representation of this object.
inherited
Operators
-
operator ==(
Object other) → bool -
The equality operator.
inherited