A quick sort algorithm to sort Vectors or arrays.
Provides sort and binary search capabilities.
This all goes away in JDK 1.2.
QuickSort
public static Object[] QuickSort(Hashtable h)
throws ClassCastException Sort a Hashtable.
h - A Hashtable with String or Ordered keys.
- A sorted array of the keys.
QuickSort
public static void QuickSort(String[] a)
This is a string version of C.A.R Hoare's Quick Sort algorithm.
This will handle arrays that are already sorted,
and arrays with duplicate keys.
Equivalent to:
QuickSort (a, 0, a.length - 1);
a - An array of String items.
QuickSort
public static void QuickSort(String[] a,
int lo0,
int hi0) This is a string version of C.A.R Hoare's Quick Sort algorithm.
This will handle arrays that are already sorted,
and arrays with duplicate keys.
If you think of a one dimensional array as going from
the lowest index on the left to the highest index on the right
then the parameters to this function are lowest index or
left and highest index or right.
a - An array of String items.lo0 - Left boundary of array partition.hi0 - Right boundary of array partition.
QuickSort
public static void QuickSort(Vector v)
throws ClassCastException This is a generic version of C.A.R Hoare's Quick Sort algorithm.
This will handle vectors that are already
sorted, and vectors with duplicate keys.
Equivalent to:
QuickSort (v, 0, v.size () - 1);
v - A Vector of Ordered items.
QuickSort
public static void QuickSort(Vector v,
int lo0,
int hi0)
throws ClassCastException This is a generic version of C.A.R Hoare's Quick Sort algorithm.
This will handle vectors that are already
sorted, and vectors with duplicate keys.
If you think of a one dimensional vector as going from
the lowest index on the left to the highest index on the right
then the parameters to this function are lowest index or
left and highest index or right.
v - A Vector of Ordered items.lo0 - Left boundary of vector partition.hi0 - Right boundary of vector partition.
QuickSort
public static void QuickSort(Ordered[] a)
This is a generic version of C.A.R Hoare's Quick Sort algorithm.
This will handle arrays that are already sorted,
and arrays with duplicate keys.
Equivalent to:
QuickSort (a, 0, a.length - 1);
a - An array of Ordered items.
QuickSort
public static void QuickSort(Ordered[] a,
int lo0,
int hi0) This is a generic version of C.A.R Hoare's Quick Sort algorithm.
This will handle arrays that are already sorted,
and arrays with duplicate keys.
If you think of a one dimensional array as going from
the lowest index on the left to the highest index on the right
then the parameters to this function are lowest index or
left and highest index or right.
a - An array of Ordered items.lo0 - Left boundary of array partition.hi0 - Right boundary of array partition.
QuickSort
public static void QuickSort(Sortable sortable)
This is a generic version of C.A.R Hoare's Quick Sort algorithm.
This will handle Sortable objects that are already
sorted, and Sortable objects with duplicate keys.
Equivalent to:
QuickSort (sortable, sortable.first (), sortable.last ());
sortable - A Sortable object.
QuickSort
public static void QuickSort(Sortable sortable,
int lo0,
int hi0) This is a generic version of C.A.R Hoare's Quick Sort algorithm.
This will handle Sortable objects that are already
sorted, and Sortable objects with duplicate keys.
sortable - A Sortable object.lo0 - Left boundary of partition.hi0 - Right boundary of partition.
bsearch
public static int bsearch(Vector vector,
Ordered ref) Binary search for an object
vector - The vector of Ordered objects.ref - The name to search for.
- The index at which reference was found or is to be inserted.
bsearch
public static int bsearch(Vector vector,
Ordered ref,
int lo,
int hi) Binary search for an object
vector - The vector of Ordered objects.ref - The name to search for.lo - The lower index within which to look.hi - The upper index within which to look.
- The index at which reference was found or is to be inserted.
bsearch
public static int bsearch(Ordered[] array,
Ordered ref) Binary search for an object
array - The array of Ordered objects.ref - The name to search for.
- The index at which reference was found or is to be inserted.
bsearch
public static int bsearch(Ordered[] array,
Ordered ref,
int lo,
int hi) Binary search for an object
array - The array of Ordered objects.ref - The name to search for.lo - The lower index within which to look.hi - The upper index within which to look.
- The index at which reference was found or is to be inserted.
bsearch
public static int bsearch(Sortable set,
Ordered ref) Binary search for an object
set - The collection of Ordered objects.ref - The name to search for.
- The index at which reference was found or is to be inserted.
bsearch
public static int bsearch(Sortable set,
Ordered ref,
int lo,
int hi) Binary search for an object
set - The collection of Ordered objects.ref - The name to search for.lo - The lower index within which to look.hi - The upper index within which to look.
- The index at which reference was found or is to be inserted.