de.weaut.sortDemo

Class HeapSort

java.lang.Object

de.weaut.sortDemo.SortApp.SortAlgorithm

de.weaut.sortDemo.HeapSort

public final class HeapSort
extends SortApp.SortAlgorithm

Heap sort algorithm demonstration.

Author Jason Harrison, his version 1.0, 23 Jun 1995

Modif. 15.11.2005, Albrecht Weinert (a-weinert.de) :
SortApp.SortAlgorithm + minor improvements.

Version:

V.16, 16.03.2019

Author:

Albrecht Weinert

Field Summary

Fields inherited from class de.weaut.sortDemo.SortApp.SortAlgorithm

stopRequested

Constructor Summary

Constructors

Constructor and Description
HeapSort()

Method Summary

Modifier and Type	Method and Description
void	downheap(int[] a, int k, int n) Heap sort helper.
static void	main(java.lang.String[] args) Start as application.
void	sort(int[] a) The real sorting method.

Methods inherited from class de.weaut.sortDemo.SortApp.SortAlgorithm

getMaxPossiVal, pause, pause, pause, startMe, stop, swap

Methods inherited from class java.lang.Object

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

Constructor Detail

HeapSort

public HeapSort()

Method Detail

sort

public void sort(int[] a)

Description copied from class: SortApp.SortAlgorithm

The real sorting method.

This method has to sort the array provided as parameter. Every substantial algorithmic step has to be marked by calling one of the callback methods SortApp.SortAlgorithm.pause(int, int), SortApp.SortAlgorithm.pause(int), SortApp.SortAlgorithm.pause() directly or indirectly by utilising SortApp.SortAlgorithm.swap(int, int) for element exchanges within the array having been provided to this sort implementation.
This pausing does all else like counting steps, displaying the sorting state and else.

As substantial step to be treated this way we see

• Assignments respectively swaps within the array to be sorted
  and (only in a first loop through the array) also
• a reading / comparing access to to one or two elements.

Specified by:

sort in class SortApp.SortAlgorithm

downheap

public void downheap(int[] a,
                     int k,
                     int n)

Heap sort helper.

Parameters:

a - the array to be sorted resp. the semi-heap to be made a heap

k - the part's root index + 1

n - the part's length

main

public static void main(java.lang.String[] args)

Start as application.

See Also:

SortApp.SortAlgorithm.startMe()