1 20 21 package fr.dyade.aaa.util; 22 23 public final class QuickSort { 24 25 26 public static void sort(Comparable v[], int low, int up) { 27 int i, last; 28 Comparable t, x; 29 30 if (low < up) { 31 t = v[low]; 32 last = low; 33 for (i = low +1; i <= up; ++i) { 34 if (t.compareTo(v[i]) > 0) { 35 last ++; 36 x = v[last]; v[last] = v[i]; v[i] = x; } 38 } 39 x = v[low]; v[low] = v[last]; v[last] = x; sort(v, low, last -1); 41 sort(v, last +1, up); 42 } 43 } 44 } 45 | Popular Tags |