java.lang.Object
org.relayirc.util.QuickSort
- public class QuickSort
- extends java.lang.Object
Quick sort implementation that will sort an array or Vector of IComparable objects.
|
Method Summary |
static boolean |
needsSorting(java.util.Vector v)
Quicksort will rearrange elements when they are all equal. |
static void |
quicksort(IComparable[] arr,
boolean ascending)
|
private static void |
quicksort(IComparable[] arr,
int left,
int right,
boolean ascending)
|
static void |
quicksort(java.util.Vector v,
boolean ascending)
|
private static void |
quicksort(java.util.Vector v,
int left,
int right,
boolean ascending)
|
private static void |
swap(java.lang.Object[] arr,
int i,
int j)
|
private static void |
swap(java.util.Vector v,
int i,
int j)
|
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
QuickSort
public QuickSort()
swap
private static void swap(java.util.Vector v,
int i,
int j)
swap
private static void swap(java.lang.Object[] arr,
int i,
int j)
quicksort
private static void quicksort(java.util.Vector v,
int left,
int right,
boolean ascending)
quicksort
private static void quicksort(IComparable[] arr,
int left,
int right,
boolean ascending)
needsSorting
public static boolean needsSorting(java.util.Vector v)
- Quicksort will rearrange elements when they are all equal. Make sure
at least two elements differ
quicksort
public static void quicksort(IComparable[] arr,
boolean ascending)
quicksort
public static void quicksort(java.util.Vector v,
boolean ascending)