Package org.ddogleg.sorting

Class Summary

Class	Description
ApproximateSort_F32	Counting sort for floating point numbers.
ApproximateSort_F64	Counting sort for floating point numbers.
BenchMarkSelect
BenchMarkSort	A class that's used to compare the speed of various sorting algorithms.
CountingSort	A O(N) sorting routine for integer valued elements with a known upper and lower bound.
QuickSelect	QuickSelect searches for the k-th largest item in the list.
QuickSort_F32	An implementation of the quick sort algorithm from Numerical Recipes Third Edition that is specified for arrays of floats.
QuickSort_F64	An implementation of the quick sort algorithm from Numerical Recipes Third Edition that is specified for arrays of doubles.
QuickSort_S32	An implementation of the quick sort algorithm from Numerical Recipes Third Edition that is specified for arrays of doubles.
QuickSortComparator<T>	An implementation of the quick sort algorithm from Numerical Recipes Third Edition that is specified for arrays of floats.
QuickSortObj_F32	An implementation of the quick sort algorithm from Numerical Recipes Third Edition that is specified for arrays of floats.
QuickSortObj_F64	An implementation of the quick sort algorithm from Numerical Recipes Third Edition that is specified for arrays of floats.
ShellSort	Implemenation of the shell sort algorithm from Numerical Recipes Third Edition.
SortableParameter_F32	Class which can be extended and allows the object to be sorted faster than a generic Comparable
SortableParameter_F64	Class which can be extended and allows the object to be sorted faster than a generic Comparable
StraightInsertionSort	An implementation of the straight insert sort algorithm.
TestApproximateSort_F32
TestApproximateSort_F64
TestCountingSort
TestQuickSelect
TestQuickSort_F32
TestQuickSort_F64
TestQuickSort_S32
TestQuickSortComparator_F64
TestQuickSortObj_F32
TestQuickSortObj_F64
TestShellSort
TestStraightInsertionSort