com.aliasi.util

Class Sort

java.lang.Object

com.aliasi.util.Sort

public class Sort
extends Object

The Sort class contains static utilities for sorting arrays of primitive values with respect to primitive comparators.

References

The algorithms were adapted from Jon Bentley's excellent book on code design and tuning, which also inspired Java's implementations:

• Bentley, Jon. 2000. Programming Pearls, 2nd Edition. Addison-Wesley.
• Bloch, Joshua. 2006. Extra, Extra - Read All About It: Nearly All Binary Searches and Mergesorts are Broken. Google Research Blog.

Since:

LingPipe 4.1.1

Version:

4.1.1

Author:

Bob Carpenter

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static interface	Sort.CompareInt The CompareInt interface is for comparing pairs of integers.

Field Summary

Fields

Modifier and Type	Field and Description
static Sort.CompareInt	NATURAL_INT_COMPARE This constant implements the CompareInt interface using the natural order of integers.

Method Summary

Modifier and Type	Method and Description
static void	isort(int[] x, Sort.CompareInt compare) Sort the specified array of integers according to the specified comparator using insertion sort.
static void	qsort(int[] x, Sort.CompareInt compare) Sort the specified array of integers according to the specified comparator using quicksort.
static void	swap(int[] xs, int i, int j) Swap the values for the array at the specified indexes.

Methods inherited from class java.lang.Object

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

Field Detail

NATURAL_INT_COMPARE

public static final Sort.CompareInt NATURAL_INT_COMPARE

This constant implements the CompareInt interface using the natural order of integers.

Method Detail

isort

public static void isort(int[] x,
                         Sort.CompareInt compare)

Sort the specified array of integers according to the specified comparator using insertion sort.

Parameters:

x - Array of ints to sort.

compare - Comparator to use for sorting.

qsort

public static void qsort(int[] x,
                         Sort.CompareInt compare)

Sort the specified array of integers according to the specified comparator using quicksort.

Parameters:

x - Array of ints to sort.

compare - Comparator to use for sorting.

swap

public static void swap(int[] xs,
                        int i,
                        int j)

Swap the values for the array at the specified indexes.

Parameters:

xs - Array of elements.

i - Index of first element in array.

j - Index of second element in array.

Throws:

IndexOutOfBoundsException - If either index is out of bounds for the array