craterdog.collections.primitives

Class MergeSorter<E>

java.lang.Object

craterdog.collections.abstractions.Sorter<E>

craterdog.collections.primitives.MergeSorter<E>

Type Parameters:

E - The type of element being sorted.

public class MergeSorter<E>
extends Sorter<E>

This sorter class implements a standard merge sort algorithm. The collection to be sorted is recursively split into two collections each of which are then sorted and then the two collections are merged back into a sorted collection.

Author:

Derk Norton

Constructor Summary

Constructors

Constructor and Description
MergeSorter()

Method Summary

Modifier and Type	Method and Description
void	sortCollection(SortableCollection<E> collection, java.util.Comparator<? super E> comparator) This method sorts the elements of its collection using a specific sorting algorithm.

Methods inherited from class craterdog.collections.abstractions.Sorter

sortCollection

Methods inherited from class java.lang.Object

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

Constructor Detail

MergeSorter

public MergeSorter()

Method Detail

sortCollection

public void sortCollection(SortableCollection<E> collection,
                           java.util.Comparator<? super E> comparator)

Description copied from class: Sorter

This method sorts the elements of its collection using a specific sorting algorithm. The specified comparator is used to compare each pair of elements during sorting.

Specified by:

sortCollection in class Sorter<E>

Parameters:

collection - The collection to be sorted.

comparator - The comparison function to be used during sorting.