Uses of Class pl.put.poznan.transformer.logic.SortAlgorithm.Order (sorting-madness 1.0 API)

Packages that use SortAlgorithm.Order
Package Description

pl.put.poznan.transformer.logic

Uses of SortAlgorithm.Order in pl.put.poznan.transformer.logic

Methods in pl.put.poznan.transformer.logic that return SortAlgorithm.Order
Modifier and Type	Method	Description
`static SortAlgorithm.Order`	SortAlgorithm.Order.`valueOf(String name)`	Returns the enum constant of this type with the specified name.
`static SortAlgorithm.Order[]`	SortAlgorithm.Order.`values()`	Returns an array containing the constants of this enum type, in the order they are declared.

Methods in pl.put.poznan.transformer.logic with parameters of type SortAlgorithm.Order
Modifier and Type	Method	Description
`static boolean`	Sorter.`countingSort(int[] tab, SortAlgorithm.Order order)`	A simple implementation of the counting sort algorithm This implementation only works for 1-D arrays of integers.
`List<Result>`	Measurer.`measure(Cell[][] data, int column, List<String> names, int maxIter, SortAlgorithm.Order order)`	Method for running tests for different sorting algorithms.
`boolean`	QuickSort.`quickSort(Cell[][] tab, int column, int start, int end, int maxDepth, SortAlgorithm.Order order)`	An in-place implementation of the quicksort algorithm
`boolean`	BinaryInsertSort.`sort(Cell[][] tab, int column, int maxIter, SortAlgorithm.Order order)`	An in-place implementation of the binary insertion sort algorithm
`boolean`	BubbleSort.`sort(Cell[][] tab, int column, int maxIter, SortAlgorithm.Order order)`	An in-place implementation of the bubble sort algorithm
`boolean`	InsertSort.`sort(Cell[][] tab, int column, int maxIter, SortAlgorithm.Order order)`	An in-place implementation of the insertion sort algorithm
`boolean`	MergeSort.`sort(Cell[][] tab, int column, int maxIter, SortAlgorithm.Order order)`	A wrapper for `MergeSort.mergeSort(Cell[][], int, int, int, int, Order)` compatible with the `SortAlgorithm` interface.
`boolean`	QuickSort.`sort(Cell[][] tab, int column, int maxIter, SortAlgorithm.Order order)`	A wrapper for `QuickSort.quickSort(Cell[][], int, int, int, int, Order)` compatible with the `SortAlgorithm` interface.
`boolean`	SelectionSort.`sort(Cell[][] tab, int column, int maxIter, SortAlgorithm.Order order)`	An in-place implementation of the selection sort algorithm
`boolean`	SortAlgorithm.`sort(Cell[][] tab, int column, int maxIter, SortAlgorithm.Order order)`	Method stub for the main sorting methods of `SortAlgorithm` implementations.
`boolean`	Sorter.`sort(Cell[][] tab, int column, int maxIter, SortAlgorithm.Order order)`	Wrapper to call `SortAlgorithm.sort(Cell[][], int, int, Order)` of the currently chosen `SortAlgorithm`.