public class Quick extends Object
For additional documentation, see Section 2.1 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
Modifier | Constructor and Description |
---|---|
private |
Quick() |
Modifier and Type | Method and Description |
---|---|
private static void |
exch(Object[] a,
int i,
int j) |
private static boolean |
isSorted(Comparable[] a)
Check if array is sorted - useful for debugging.
|
private static boolean |
isSorted(Comparable[] a,
int lo,
int hi) |
private static boolean |
less(Comparable v,
Comparable w)
Helper sorting functions.
|
static void |
main(String[] args)
Reads in a sequence of strings from standard input; quicksorts them;
and prints them to standard output in ascending order.
|
private static int |
partition(Comparable[] a,
int lo,
int hi) |
static Comparable |
select(Comparable[] a,
int k)
Rearranges the array so that a[k] contains the kth smallest key;
a[0] through a[k-1] are less than (or equal to) a[k]; and
a[k+1] through a[N-1] are greater than (or equal to) a[k].
|
private static void |
show(Comparable[] a) |
static void |
sort(Comparable[] a)
Rearranges the array in ascending order, using the natural order.
|
private static void |
sort(Comparable[] a,
int lo,
int hi) |
private Quick()
public static void sort(Comparable[] a)
a
- the array to be sortedprivate static void sort(Comparable[] a, int lo, int hi)
private static int partition(Comparable[] a, int lo, int hi)
public static Comparable select(Comparable[] a, int k)
a
- the arrayk
- find the kth smallestprivate static boolean less(Comparable v, Comparable w)
private static boolean isSorted(Comparable[] a)
private static boolean isSorted(Comparable[] a, int lo, int hi)
private static void show(Comparable[] a)
WebARTS Library Licensed Under the GNU - General Public License. Other Libraries licensed under their respective Open Source Licenses