org.ddogleg.sorting

Class QuickSort_F32

java.lang.Object

org.ddogleg.sorting.QuickSort_F32

public class QuickSort_F32
extends java.lang.Object

An implementation of the quick sort algorithm from Numerical Recipes Third Edition that is specified for arrays of floats. 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(float[]). Not noticeable in most applications.

Constructor Summary

Constructors

Constructor and Description
QuickSort_F32()
QuickSort_F32(int NSTACK, int M)

Method Summary

Modifier and Type	Method and Description
void	sort(float[] arr, int length)
void	sort(float[] arr, int length, int[] indexes)

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

QuickSort_F32

public QuickSort_F32()

QuickSort_F32

public QuickSort_F32(int NSTACK,
                     int M)

Method Detail

sort

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

sort

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