好的。我有一个标准的归并排序类。
public class Merge extends SortAlgorithm {
public static void sort(Comparable[] a) {
Comparable[] aux = new Comparable[a.length];
sort(a, aux, 0, a.length -1);
}
protected static void sort(Comparable[] a, Comparable[] aux, int lo, int hi) {
if(hi <= lo)
return;
int mid = (lo + hi)/2;
sort(a, aux, lo, mid);
sort(a, aux, mid+1, hi);
if(less(a[mid+1], a[mid]))
merge(a, aux, lo, mid, hi);
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] a = br.readLine().split(" …Run Code Online (Sandbox Code Playgroud)