com.silentq.sort
Class QuickSort

java.lang.Object
  |
  +--com.silentq.sort.QuickSort
public class QuickSort
extends java.lang.Object

QuickSort is the most popular sorting algorithm. It was invented in 1962 by C. A. R. Hoare. It is one of the fastest and most efficient sorting algorithms, with a running time from nlogn to n squared. This implementation is a fairly standard one.

Constructor Summary
QuickSort()
           
 
Method Summary
static byte[] sort(byte[] values)
          Sorts an array of bytes in place, and returns the array.
static char[] sort(char[] values)
          Sorts an array of chars in place, and returns the array.
static double[] sort(double[] values)
          Sorts an array of doubles in place, and returns the array.
static float[] sort(float[] values)
          Sorts an array of floats in place, and returns the array.
static java.util.Vector sort(java.util.Hashtable values)
          Sorts a Hashtable based on the keys.
static int[] sort(int[] values)
          Sorts an array of ints in place, and returns the array.
static long[] sort(long[] values)
          Sorts an array of longs in place, and returns the array.
static short[] sort(short[] values)
          Sorts an array of shorts in place, and returns the array.
static java.lang.String[] sort(java.lang.String[] values)
          Sorts an array of Strings in place, and returns the array.
static java.util.Vector sort(java.util.Vector values)
          Sorts a Vector in place, and returns the Vector.
static java.util.Vector sort(java.util.Vector values, int loval, int hival)
          This is the actual quicksort method.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

QuickSort

public QuickSort()
Method Detail

sort

public static int[] sort(int[] values)
Sorts an array of ints in place, and returns the array.
Parameters:
values - The int array.
Returns:
The sorted array.

sort

public static char[] sort(char[] values)
Sorts an array of chars in place, and returns the array.
Parameters:
values - The char array.
Returns:
The sorted array.

sort

public static byte[] sort(byte[] values)
Sorts an array of bytes in place, and returns the array.
Parameters:
values - The byte array.
Returns:
The sorted array.

sort

public static short[] sort(short[] values)
Sorts an array of shorts in place, and returns the array.
Parameters:
values - The short array.
Returns:
The sorted array.

sort

public static long[] sort(long[] values)
Sorts an array of longs in place, and returns the array.
Parameters:
values - The long array.
Returns:
The sorted array.

sort

public static float[] sort(float[] values)
Sorts an array of floats in place, and returns the array.
Parameters:
values - The float array.
Returns:
The sorted array.

sort

public static double[] sort(double[] values)
Sorts an array of doubles in place, and returns the array.
Parameters:
values - The double array.
Returns:
The sorted array.

sort

public static java.lang.String[] sort(java.lang.String[] values)
Sorts an array of Strings in place, and returns the array.
Parameters:
values - The String array.
Returns:
The sorted array.

sort

public static java.util.Vector sort(java.util.Vector values)
Sorts a Vector in place, and returns the Vector.
Parameters:
values - The Vector.
Returns:
The sorted Vector.

sort

public static java.util.Vector sort(java.util.Hashtable values)
Sorts a Hashtable based on the keys.
Parameters:
values - The Hashtable.
Returns:
The sorted keys in a Vector.

sort

public static java.util.Vector sort(java.util.Vector values,
                                    int loval,
                                    int hival)
This is the actual quicksort method. It sorts a Vector of objects, based on their type.
Parameters:
values - The Vector of values to sort.
loval - The index of the low end of the range to sort.
hival - The index of the high end of the range to sort.
Returns:
The sorted Vector.