1 package org.ibex.classgen.util;
3 public final class Sort {
6 public interface Comparable { public int compareTo(Object o); }
7 public interface CompareFunc { public int compare(Object a, Object b); }
9 private static final CompareFunc comparableCompareFunc = new CompareFunc() {
10 public int compare(Object a,Object b) { return ((Comparable)a).compareTo(b); }
13 public static void sort(Comparable[] a) { sort(a,comparableCompareFunc); }
14 public static void sort(Object[] a, CompareFunc c) { sort(a,c,0,a.length-1); }
16 private static void sort(Object[] a, CompareFunc c, int start, int end) {
18 if(start >= end) return;
20 for(int i=start+1;i<=end;i++) {
23 for(j=i-1;j>=start;j--) {
24 if(c.compare(a[j],tmp) <= 0) break;
32 Object pivot = a[end];
37 while((lo < hi) && c.compare(a[++lo],pivot) < 0) { }
38 while((hi > lo) && c.compare(a[--hi],pivot) > 0) { }
39 tmp = a[lo]; a[lo] = a[hi]; a[hi] = tmp;
42 tmp = a[lo]; a[lo] = a[end]; a[end] = tmp;
44 sort(a, c, start, lo-1);
45 sort(a, c, lo+1, end);