Package pl.put.poznan.transformer.logic

Class QuickSort

java.lang.Object

pl.put.poznan.transformer.logic.QuickSort

All Implemented Interfaces:

SortAlgorithm

public class QuickSort
extends Object
implements SortAlgorithm

A class containing an implementation of quicksort. Implements the SortAlgorithm interface.

Nested Class Summary

Nested classes/interfaces inherited from interface pl.put.poznan.transformer.logic.SortAlgorithm

SortAlgorithm.Order

Constructor Summary

Constructors

Constructor	Description
QuickSort()

Method Summary

Modifier and Type	Method	Description
boolean	quickSort(Cell[][] tab, int column, int start, int end, int maxDepth, SortAlgorithm.Order order)	An in-place implementation of the quicksort algorithm
boolean	sort(Cell[][] tab, int column, int maxIter, SortAlgorithm.Order order)	A wrapper for quickSort(Cell[][], int, int, int, int, Order) compatible with the SortAlgorithm interface.

Methods inherited from class java.lang.Object

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

Constructor Detail

QuickSort

public QuickSort()

Method Detail

sort

public boolean sort(Cell[][] tab,
                    int column,
                    int maxIter,
                    SortAlgorithm.Order order)

A wrapper for quickSort(Cell[][], int, int, int, int, Order) compatible with the SortAlgorithm interface.

Specified by:

sort in interface SortAlgorithm

Parameters:

tab - a 2-D array of type Cell to be sorted.

column - the index of the column which will be the sorting criteria.

maxIter - maximum recursion depth. Value of -1 means unlimited iterations, <-1 means none.

order - an enum Order value determining the sorting direction.

Returns:

a boolean value of whether sorting could be completed in the given number of iterations.

quickSort

public boolean quickSort(Cell[][] tab,
                         int column,
                         int start,
                         int end,
                         int maxDepth,
                         SortAlgorithm.Order order)

An in-place implementation of the quicksort algorithm

Parameters:

tab - a 2-D array of type Cell to be sorted.

column - the index of the column which will be the sorting criteria.

start - the index of the first value to be included in the sorting.

end - the index of the last value to be included in the sorting.

maxDepth - maximum recursion depth. Value of -1 means unlimited iterations, <-1 means none.

order - an enum Order value determining the sorting direction.

Returns:

a boolean value of whether sorting could be completed in the given number of iterations.