de.weaut.sortDemo

Class EQSort

java.lang.Object

de.weaut.sortDemo.SortApp.SortAlgorithm

de.weaut.sortDemo.EQSort

public final class EQSort
extends SortApp.SortAlgorithm

Enhanced quick sort algorithm demonstration.

SortAlgorithm.java, Thu Oct 27 10:32:35 1994
Author: Jim Boritz, his version: 1.0, 26 Jun 1995

21 Jun 1996: Modified code based on comments from Paul Haeberli, and Peter Schweizer. Used Daeron Meyer's code for the new pivoting code.

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
EQSort()

Method Summary

Modifier and Type	Method and Description
static void	brute(int[] a, int lo, int hi) The quick sort algorithm helper for small parts.
static void	main(java.lang.String[] args) Start as application.
void	sort(int[] a) The real sorting method.
(package private) void	sort(int[] a, int lo0, int hi0) The quick sort algorithm.

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

EQSort

public EQSort()

Method Detail

brute

public static void brute(int[] a,
                         int lo,
                         int hi)

The quick sort algorithm helper for small parts.

This methods sorts the array a's part from index lo0 to index hi0.
It must hold: 0 <= lo0 <= hi0 < a.length and hi - lo <=3.

Hint: This method for sorting small parts only is used by sort(int[]). It does not depend on the demo Applet/application and may be used independently.

Parameters:

a - the array to be sorted

lo - the lower index

hi - the upper index

sort

void sort(int[] a,
          int lo0,
          int hi0)

The quick sort algorithm.

This methods sorts the array a's part from index lo0 to index hi0.
It must hold: 0 <= lo0 <= hi0 < a.length.

Parameters:

a - the array to be sorted

lo0 - the lower index

hi0 - the upper index

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

main

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

Start as application.

See Also:

SortApp.SortAlgorithm.startMe()