uk.ac.gla.terrier.sorting
Class HeapSort

java.lang.Object
  uk.ac.gla.terrier.sorting.HeapSort

public class HeapSort
extends java.lang.Object

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.

Version:

$Revision: 1.15 $

Author:

Vassilis Plachouras

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.

Methods inherited from class java.lang.Object

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

Constructor Detail

HeapSort

public HeapSort()

Method Detail

heapSort

public static void heapSort(double[] A,
                            int[] B)

Sorts the given array using heap-sort in ascending order

Parameters:

A - int[] the array to be sorted

heapSort

public static void heapSort(double[] A,
                            int[] B,
                            int topElements)

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

Parameters:

A - int[] the array to be sorted

topElements - int the number of elements to be sorted.