net.anotheria.util.sorter

Class QuickSorter<T extends IComparable>

java.lang.Object

net.anotheria.util.sorter.AbstractSorter<T>

net.anotheria.util.sorter.QuickSorter<T>

All Implemented Interfaces:

Sorter<T>

public class QuickSorter<T extends IComparable>
extends AbstractSorter<T>

just an implementation of the well known QuickSort Algorithm

Since:

21.10.2000

Author:

Chris Hoffmann

Constructor Summary

Constructors

Constructor and Description
QuickSorter()

Method Summary

Methods

Modifier and Type	Method and Description
List<T>	sort(Enumeration<T> source, SortType sType) sorts an Enumeration with the QuickSort Algorithm and returns a sorted Vector
List<T>	sort(List<T> source, SortType sType) sorts a List with the QuickSort Algorithm

Methods inherited from class net.anotheria.util.sorter.AbstractSorter

array2list, array2vector, list2array, vector2array

Methods inherited from class java.lang.Object

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

Constructor Detail

QuickSorter

public QuickSorter()

Method Detail

sort

public List<T> sort(Enumeration<T> source,
           SortType sType)

sorts an Enumeration with the QuickSort Algorithm and returns a sorted Vector

Specified by:

sort in interface Sorter<T extends IComparable>

Overrides:

sort in class AbstractSorter<T extends IComparable>

Parameters:

source - the Enumeration you want to sort

sType - how you want to sort

Returns:

a sorted Vector containing the Objects of the Enumeration

sort

public List<T> sort(List<T> source,
           SortType sType)

sorts a List with the QuickSort Algorithm

Parameters:

source - the vector you want to sort

sType - SortType ... how you wanna sort the Vector

Returns:

the sorted Vector