|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.ObjectMergesort
public class Mergesort
The Mergesort Java application illustrates a merge sort.
| Constructor Summary | |
|---|---|
Mergesort()
|
|
| Method Summary | |
|---|---|
static void |
main(java.lang.String[] args)
The main method illustrates the use of a merge sort to sort a small array. |
static void |
mergesort(int[] data,
int first,
int n)
Sort an array of integers from smallest to largest, using a merge sort algorithm. |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public Mergesort()
| Method Detail |
|---|
public static void main(java.lang.String[] args)
String arguments (args) are not used
in this implementation.
public static void mergesort(int[] data,
int first,
int n)
data - the array to be sortedfirst - the start index for the portion of the array that will be sortedn - the number of elements to sort
data[first] through data[first+n-1] are valid
parts of the array.
n is zero or negative then no work is done. Otherwise,
the elements of data have been rearranged so that
data[first] <= data[first+1] <= ... <= data[first+n-1].
java.lang.ArrayIndexOutOfBoundsException - Indicates that first+n-1 is an index beyond the end of the
array.
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||