SortAlgorithm (sorting-madness 1.0 API)

All Known Implementing Classes:

BinaryInsertSort, BubbleSort, InsertSort, MergeSort, QuickSort, SelectionSort
```
public interface SortAlgorithm
```
Interface defining a sorting algorithm. Concrete implementations of this interface are used to sort data in a number of ways.

Nested Class Summary

Nested Classes
Modifier and Type Interface Description

static class SortAlgorithm.Order
An enumeration type for holding information about sorting direction.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`boolean`	`sort(Cell[][] tab, int column, int maxIter, SortAlgorithm.Order order)`	Method stub for the main sorting methods of `SortAlgorithm` implementations.

- Method Detail
  - sort
```
boolean sort(Cell[][] tab,
             int column,
             int maxIter,
             SortAlgorithm.Order order)
```
    Method stub for the main sorting methods of SortAlgorithm implementations. Sorting is performed in-place using the given array of data.
    
    Parameters:
    
    tab - a 2-D array of type Cell to be sorted
    
    column - the number of the column which will be the sorting criteria.
    
    maxIter - maximum number of iterations. 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.