com.sl.algorithms.sort.generalpurpose.merge

Class MergeSort<T extends java.lang.Comparable>

java.lang.Object

com.sl.algorithms.sort.generalpurpose.merge.MergeSort<T>

All Implemented Interfaces:

BaseInterface<T>, Constants, SortingEngine<T>

Direct Known Subclasses:

BottomUpMergeSort, TopDownMergeSort

public abstract class MergeSort<T extends java.lang.Comparable>
extends java.lang.Object
implements SortingEngine<T>

A general-purpose stable sort algorithm with a guaranteed time complexity of O(nlogn) and O(n) space.

Inventor: John Von Neumann

Reference 1
Reference 2

Field Summary

Fields inherited from interface com.sl.algorithms.core.interfaces.base.Constants

ARRAY_IS_EMPTY, DATA_TYPE_NOT_SUPPORTED_YET, DECIMAL_RADIX, DELIMITER_COMMA, ELEMENT_NOT_FOUND, LIST_IS_EMPTY, OPERATION_NOT_SUPPORTED_YET

Constructor Summary

Constructors

Constructor and Description
MergeSort()

Method Summary

Modifier and Type	Method and Description
void	merge(T[] source, int s, int m, int e, T[] target) Objective: MERGE and SORT 2 parts (s to m and m to e) of an array A (read-only), into an output array B.

Methods inherited from class java.lang.Object

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

Methods inherited from interface com.sl.algorithms.core.interfaces.sort.SortingEngine

sort, sortList

Methods inherited from interface com.sl.algorithms.core.interfaces.base.BaseInterface

checkArray, checkIntArray, checkList

Constructor Detail

MergeSort

public MergeSort()

Method Detail

merge

public void merge(T[] source,
                  int s,
                  int m,
                  int e,
                  T[] target)

Objective: MERGE and SORT 2 parts (s to m and m to e) of an array A (read-only), into an output array B.

Parameters:

source - unsorted input array

s - start index

m - midpoint

e - end index

target - auxiliary array to help in the sort process