Package org.terrier.sorting

Provides the classes that implement the sorting of various arrays for the Terrier platform.

Used by indexing and retrieval

Class Summary

Class	Description
HeapSort	An implementation of the heap sort algorithm as described in Cormen et al.
HeapSortInt	An implementation of the heap sort algorithm as described in Cormen et al.
MultiSort	The current implementation is a simple extension of the existing HeapSort to allow an int array to be used as the key array while sorting.
SortAscendingPairedVectors	This class sorts a pair of arrays, where the corresponding entries are related.
SortAscendingQuadrupleVectors	This class sorts four arrays, where the corresponding entries are related.
SortAscendingQuintupleVectors	This class sorts five arrays, where the corresponding entries are related.
SortAscendingTripleVectors	This class sorts five arrays, where the corresponding entries are related.
SortAscendingVectors	This class sorts one or more arrays, based on sorting a key array, ie where the corresponding entries are related.
SortDescendingPairedVectors	This class sorts a pair of arrays, where the corresponding entries are related.