org.terrier.sorting

Class MultiSort

java.lang.Object

org.terrier.sorting.MultiSort

public class MultiSort
extends Object

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. Ideally, this class should replace HeapSort to provide sorting of multiple numeric arrays (not necessarily of a specific numeric type), and to allow multiple keys to be used for sorting. Also, it might be interesting to an alternative sorting algorithm, such as quick sort.

Author:

Rodrygo Santos

Constructor Summary

Constructors

Constructor and Description
MultiSort()

Method Summary

Methods

Modifier and Type	Method and Description
static void	ascendingHeapSort(Comparable<?>[] A, int[] B) Sorts the given arrays in ascending order, using heap-sort.
static void	ascendingHeapSort(double[] A, int[] B, short[] C) Sorts the given arrays in ascending order, using heap-sort.
static void	ascendingHeapSort(double[] A, int[] B, short[] C, int topElements) Sorts the top topElements of the given array in ascending order, using heap sort.
static void	ascendingHeapSort(int[] A, double[] B, short[] C, int topElements) ascendingHeapSort
static void	descendingHeapSort(double[] A, int[] B, short[] C) Sorts the given arrays in descending order, using heap-sort.
static void	descendingHeapSort(double[] A, int[] B, short[] C, int topElements) Sorts the top topElements of the given array in descending order, using heap sort for sorting the values in ascending order and then reversing the order of a specified number of elements.

Methods inherited from class java.lang.Object

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

Constructor Detail

MultiSort

public MultiSort()

Method Detail

ascendingHeapSort

public static final void ascendingHeapSort(double[] A,
                     int[] B,
                     short[] C)

Sorts the given arrays in ascending order, using heap-sort.

Parameters:

A - double[] the first array to be sorted.

B - int[] the second array to be sorted, according to the values of the first array.

ascendingHeapSort

public static final void ascendingHeapSort(Comparable<?>[] A,
                     int[] B)

Sorts the given arrays in ascending order, using heap-sort.

Parameters:

A - double[] the first array to be sorted.

B - int[] the second array to be sorted, according to the values of the first array.

descendingHeapSort

public static final void descendingHeapSort(double[] A,
                      int[] B,
                      short[] C)

Sorts the given arrays in descending order, using heap-sort.

Parameters:

A - double[] the first array to be sorted.

B - int[] the second array to be sorted, according to the values of the first array.

ascendingHeapSort

public static final void ascendingHeapSort(double[] A,
                     int[] B,
                     short[] C,
                     int topElements)

Sorts the top topElements of the given array in ascending order, using heap sort.

Parameters:

A - double[] the first array to be sorted.

B - int[] the second array to be sorted, according to the values of the first array.

topElements - int the number of elements to be sorted.

ascendingHeapSort

public static final void ascendingHeapSort(int[] A,
                     double[] B,
                     short[] C,
                     int topElements)

ascendingHeapSort

Parameters:

A -

B -

C -

topElements -

descendingHeapSort

public static final void descendingHeapSort(double[] A,
                      int[] B,
                      short[] C,
                      int topElements)

Sorts the top topElements of the given array in descending order, using heap sort for sorting the values in ascending order and then reversing the order of a specified number of elements.

Parameters:

A - double[] the first array to be sorted.

B - int[] the second array to be sorted, according to the values of the first array.

topElements - int the number of elements to be sorted.