edu.princeton.cs.algorithms

Class Insertion

java.lang.Object

edu.princeton.cs.algorithms.Insertion

public class Insertion
extends Object

The Insertion class provides static methods for sorting an array using insertion sort.

For additional documentation, see Section 2.1 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

Author:

Robert Sedgewick, Kevin Wayne

Method Summary

Methods

Modifier and Type	Method and Description
static int[]	indexSort(Comparable[] a) Returns a permutation that gives the elements in the array in ascending order.
static void	main(String[] args) Reads in a sequence of strings from standard input; insertion sorts them; and prints them to standard output in ascending order.
static void	sort(Comparable[] a) Rearranges the array in ascending order, using the natural order.
static void	sort(Object[] a, Comparator c) Rearranges the array in ascending order, using a comparator.

Methods inherited from class java.lang.Object

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

Method Detail

sort

public static void sort(Comparable[] a)

Rearranges the array in ascending order, using the natural order.

Parameters:

a - the array to be sorted

sort

public static void sort(Object[] a,
        Comparator c)

Rearranges the array in ascending order, using a comparator.

Parameters:

a - the array

c - the comparator specifying the order

indexSort

public static int[] indexSort(Comparable[] a)

Returns a permutation that gives the elements in the array in ascending order.

Parameters:

a - the array

Returns:

a permutation p[] such that a[p[0]], a[p[1]], ..., a[p[N-1]] are in ascending order

main

public static void main(String[] args)

Reads in a sequence of strings from standard input; insertion sorts them; and prints them to standard output in ascending order.