QuickSort

Documentation of 'org.ddogleg.sorting.QuickSort_S32' Java class QuickSort_S32

```
public class QuickSort_S32
extends java.lang.Object
```
An implementation of the quick sort algorithm from Numerical Recipes Third Edition that is specified for arrays of doubles. 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.

Constructors
Constructor and Description
`QuickSort_S32()`
`QuickSort_S32(int NSTACK, int M)`

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`sort(int[] arr, int length)`
`void`	`sort(int[] arr, int length, int[] indexes)`

public QuickSort_S32(int NSTACK,
                     int M)

public void sort(int[] arr,
                 int length)

public void sort(int[] arr,
                 int length,
                 int[] indexes)

Class QuickSort_S32