Module com.aoapps.hodgepodge

Package com.aoapps.hodgepodge.sort

Class EQSort

java.lang.Object

com.aoapps.hodgepodge.sort.EQSort

All Implemented Interfaces:

ComparisonSortAlgorithm<Object>, SortAlgorithm<Object>

public final class EQSort
extends Object

An enhanced quick sort demonstration algorithm SortAlgorithm.java, Thu Oct 27 10:32:35 1994

 19 Feb 1996: Fixed to avoid infinite loop discoved by Paul Haberli.
              Misbehaviour expressed when the pivot element was not unique.
              -Jason Harrison

 21 Jun 1996: Modified code based on comments from Paul Haeberli, and
              Peter Schweizer (Peter.Schweizer@mni.fh-giessen.de).
              Used Daeron Meyer's (daeron@geom.umn.edu) code for the
              new pivoting code. - Jason Harrison

 09 Jan 1998: Another set of bug fixes by Thomas Everth (everth@wave.co.nz)
              and John Brzustowski (jbrzusto@gpu.srv.ualberta.ca).
 

Adapted from Jim Boritz' EQSortAlgorithm.

Version:

1.0, 26 Jun 1995

Author:

Jim Boritz

Method Summary

Modifier and Type	Method	Description
protected static <T> int	compare(List<T> list, int i, int j, Comparator<? super T> comparator, SortStatistics stats)
protected static <T> int	compare(T[] array, int i, int j, Comparator<? super T> comparator, SortStatistics stats)
protected static <T> int	compare(T o1, T o2, Comparator<? super T> comparator, SortStatistics stats)
protected static <T> T	get(List<T> list, int i, SortStatistics stats)
protected static <T> T	get(T[] array, int i, SortStatistics stats)
static EQSort	getInstance()
boolean	isStable()	Checks if this is a stable sort.
protected static <T> void	set(List<T> list, int i, T o, SortStatistics stats)
protected static <T> void	set(T[] array, int i, T o, SortStatistics stats)
<T extends E> void	sort(List<T> list)
<T extends E> void	sort(List<T> list, SortStatistics stats)
<T extends E> void	sort(List<T> list, Comparator<? super T> comparator)
<T> void	sort(List<T> list, Comparator<? super T> comparator, SortStatistics stats)
<T extends E> void	sort(T[] array)
<T extends E> void	sort(T[] array, SortStatistics stats)
<T extends E> void	sort(T[] array, Comparator<? super T> comparator)
<T> void	sort(T[] array, Comparator<? super T> comparator, SortStatistics stats)
protected static <T> void	swap(List<T> list, int i, int j, SortStatistics stats)
protected static <T> void	swap(T[] array, int i, int j, SortStatistics stats)

Methods inherited from class java.lang.Object

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

Method Detail

getInstance

public static EQSort getInstance()

isStable

public boolean isStable()

Description copied from interface: SortAlgorithm

Checks if this is a stable sort. A stable sort will keep elements with equal values in their same relative order.

sort

public <T> void sort(List<T> list,
                     Comparator<? super T> comparator,
                     SortStatistics stats)

Specified by:

sort in interface ComparisonSortAlgorithm<Object>

sort

public <T> void sort(T[] array,
                     Comparator<? super T> comparator,
                     SortStatistics stats)

Specified by:

sort in interface ComparisonSortAlgorithm<Object>

sort

public <T extends E> void sort(List<T> list)

Specified by:

sort in interface SortAlgorithm<E>

sort

public <T extends E> void sort(T[] array)

Specified by:

sort in interface SortAlgorithm<E>

sort

public <T extends E> void sort(List<T> list,
                               SortStatistics stats)

Specified by:

sort in interface SortAlgorithm<E>

sort

public <T extends E> void sort(T[] array,
                               SortStatistics stats)

Specified by:

sort in interface SortAlgorithm<E>

sort

public <T extends E> void sort(List<T> list,
                               Comparator<? super T> comparator)

Specified by:

sort in interface ComparisonSortAlgorithm<E>

sort

public <T extends E> void sort(T[] array,
                               Comparator<? super T> comparator)

Specified by:

sort in interface ComparisonSortAlgorithm<E>

compare

protected static <T> int compare(List<T> list,
                                 int i,
                                 int j,
                                 Comparator<? super T> comparator,
                                 SortStatistics stats)

compare

protected static <T> int compare(T[] array,
                                 int i,
                                 int j,
                                 Comparator<? super T> comparator,
                                 SortStatistics stats)

compare

protected static <T> int compare(T o1,
                                 T o2,
                                 Comparator<? super T> comparator,
                                 SortStatistics stats)

get

protected static <T> T get(List<T> list,
                           int i,
                           SortStatistics stats)

get

protected static <T> T get(T[] array,
                           int i,
                           SortStatistics stats)

set

protected static <T> void set(List<T> list,
                              int i,
                              T o,
                              SortStatistics stats)

set

protected static <T> void set(T[] array,
                              int i,
                              T o,
                              SortStatistics stats)

swap

protected static <T> void swap(List<T> list,
                               int i,
                               int j,
                               SortStatistics stats)

swap

protected static <T> void swap(T[] array,
                               int i,
                               int j,
                               SortStatistics stats)