com.sl.algorithms.sort.generalpurpose.smalldata

Class InsertionSort<T extends java.lang.Comparable>

java.lang.Object

com.sl.algorithms.sort.generalpurpose.smalldata.InsertionSort<T>

All Implemented Interfaces:

BaseInterface<T>, Constants, SortingEngine<T>

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

In-place, stable and online quadratic-complexity sort algorithm useful for small data-set.

Approach: Given a list, take the current element and insert it at the appropriate position of the list, adjusting the list every time you insert. It is similar to arranging the cards in a Card game.

Usage: Typical implementations of the general-purpose quick/merge-sort also switch to insertion-sort for small data-sets.
Insertion Sort an adaptive algorithm i.e. efficient for data sets already sorted to some degree.

Inner Loop: operates on the Sorted portion.
Reference

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
InsertionSort()

Method Summary

Modifier and Type	Method and Description
void	sort(T[] objects)
ListNode<T>	sortList(ListNode<T> head) Reference

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.base.BaseInterface

checkArray, checkIntArray, checkList

Constructor Detail

InsertionSort

public InsertionSort()

Method Detail

sort

public void sort(T[] objects)

Specified by:

sort in interface SortingEngine<T extends java.lang.Comparable>

sortList

public ListNode<T> sortList(ListNode<T> head)

Reference

Specified by:

sortList in interface SortingEngine<T extends java.lang.Comparable>