public class QuickSort_S32
extends java.lang.Object
A small amount of memory is declared for this sorting algorithm.
This implementation seems to often perform slower than Shell sort. A comment in Numerical recipes about unnecessary array checks makes me think this is slow because java always does a bounds check on arrays.
This has slightly better performance than Arrays.sort(double[]). Not noticeable in most applications.
Constructor and Description |
---|
QuickSort_S32() |
QuickSort_S32(int NSTACK,
int M) |
Modifier and Type | Method and Description |
---|---|
void |
sort(int[] arr,
int length,
int[] indexes) |