public final class LongDualPivotQuicksort
extends Object
This class implements the Dual-Pivot Quicksort algorithm by
Vladimir Yaroslavskiy, Jon Bentley, and Josh Bloch. The algorithm
offers O(n log(n)) performance on many data sets that cause other
quicksorts to degrade to quadratic performance, and is typically
faster than traditional (one-pivot) Quicksort implementations.
All exposed methods are package-private, designed to be invoked
from public methods (in class Arrays) after performing any
necessary array bounds checks and expanding parameters into the
required forms.
- Since:
- 1.7
- Version:
- 2011.02.11 m765.827.12i:5\7pm
- Author:
- Vladimir Yaroslavskiy, Jon Bentley, Josh Bloch