teetime.stage.quicksort

Class QuicksortProblem

java.lang.Object

teetime.framework.divideandconquer.Identifiable

teetime.framework.divideandconquer.AbstractDivideAndConquerProblem<QuicksortProblem,QuicksortSolution>

teetime.stage.quicksort.QuicksortProblem

public class QuicksortProblem
extends AbstractDivideAndConquerProblem<QuicksortProblem,QuicksortSolution>

A problem to be solved with the quicksort algorithm.

Author:

Robin Mohr

Constructor Summary

Constructors

Constructor and Description
QuicksortProblem(int... numbers)
QuicksortProblem(int low, int high, int... numbers) An implementation of a quicksort problem.
QuicksortProblem(int identifier, int low, int high, int... numbers)

Method Summary

Modifier and Type	Method and Description
QuicksortSolution	baseSolve() Solves the problem, only if it is a base case problem.
QuicksortSolution	baseSolve(int low, int high, int[] numbers)
DividedDCProblem<QuicksortProblem>	divide() Divides the problem and creates a DividedDCProblem.
int	getHigh()
int	getLow()
int[]	getNumbers()
boolean	isBaseCase() Determines whether or not the problem is a base case.
QuicksortSolution	solveDirectly()
String	toString()

Methods inherited from class teetime.framework.divideandconquer.Identifiable

getID

Methods inherited from class java.lang.Object

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

Constructor Detail

QuicksortProblem

public QuicksortProblem(int... numbers)

QuicksortProblem

public QuicksortProblem(int low,
                        int high,
                        int... numbers)

An implementation of a quicksort problem.

Parameters:

low - Pointer to the lower bound of indices to be compared in the array

high - Pointer to the upper bound of indices to be compared in the array

numbers - Array to be sorted

QuicksortProblem

public QuicksortProblem(int identifier,
                        int low,
                        int high,
                        int... numbers)

Method Detail

getLow

public int getLow()

getHigh

public int getHigh()

getNumbers

public int[] getNumbers()

toString

public String toString()

Overrides:

toString in class Object

isBaseCase

public boolean isBaseCase()

Description copied from class: AbstractDivideAndConquerProblem

Determines whether or not the problem is a base case.

Specified by:

isBaseCase in class AbstractDivideAndConquerProblem<QuicksortProblem,QuicksortSolution>

Returns:

The boolean whose properties determine the split condition

divide

public DividedDCProblem<QuicksortProblem> divide()

Description copied from class: AbstractDivideAndConquerProblem

Divides the problem and creates a DividedDCProblem.

Specified by:

divide in class AbstractDivideAndConquerProblem<QuicksortProblem,QuicksortSolution>

Returns:

DividedDCProblem

solveDirectly

public QuicksortSolution solveDirectly()

baseSolve

public QuicksortSolution baseSolve()

Description copied from class: AbstractDivideAndConquerProblem

Solves the problem, only if it is a base case problem.

Specified by:

baseSolve in class AbstractDivideAndConquerProblem<QuicksortProblem,QuicksortSolution>

Returns:

AbstractDivideAndConquerSolution

baseSolve

public QuicksortSolution baseSolve(int low,
                                   int high,
                                   int[] numbers)