|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object org.terrier.sorting.HeapSort
public class HeapSort
An implementation of the heap sort algorithm as described in Cormen et al. Introduction to Algorithms. In addition, this class may sort a part of an array in ascending order, so that the maximum N elements of the array are placed in the array's last N positions (the maximum entry of the array will be in array[array.length-1], the second maximum in array[array.length-2] etc.
Constructor Summary | |
---|---|
HeapSort()
|
Method Summary | |
---|---|
static void |
heapSort(double[] A,
int[] B)
Sorts the given array using heap-sort in ascending order |
static void |
heapSort(double[] A,
int[] B,
int topElements)
Sorts the top topElements of the given array in ascending order using heap sort. |
static void |
heapSort(int[] A,
double[] B)
Sorts the given array using heap-sort in ascending order |
static void |
heapSort(int[] A,
double[] B,
int topElements)
Sorts the top topElements of the given array in ascending order using heap sort. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public HeapSort()
Method Detail |
---|
public static void heapSort(double[] A, int[] B)
A
- int[] the array to be sortedpublic static void heapSort(double[] A, int[] B, int topElements)
A
- int[] the array to be sortedtopElements
- int the number of elements to be sorted.public static void heapSort(int[] A, double[] B)
A
- int[] the array to be sortedpublic static void heapSort(int[] A, double[] B, int topElements)
A
- int[] the array to be sortedtopElements
- int the number of elements to be sorted.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |