使用快速排序按列对二维数组排序

Question

public class QuickSort1D {

    public static void main(String[] args) {
        int[] A = {9, 3, 10, 4, 1, 44, 12, 2, 90, 0};
        int l = 0;
        int r = A.length-1;
        QuickSort(A, l, r);
        for (int i = 0; i < A.length; i++){
            System.out.print(A[i] + " ");
        }
    }

    private static void QuickSort(int[] a, int l, int r) {
        int i;
        if (r > l){
            i = partition(a, l, r);
            QuickSort(a, l, i-1);
            QuickSort(a, i+1, r);
        }
    }

    private static int partition(int[] a, int l, int r) {
        int v = a[r];
        int i = l;
        int j = r;
        int temp;
        while (i < j){
            while (a[i] < v){
                i = i + 1;
            }
            while ((i < j) && (a[j] >= v)){
                j = j - 1;
            }
            temp = a[i];
            if (i < j){
                a[i] = a[j];
                a[j] = temp;
            }else{
                a[i] = a[r];
                a[r] = temp;
            }
        }
        return i;
    }
}

{{4, 1, 3},
{6, 0, 2},
{5, 9, 8}}

{{6, 0, 2},
{4, 1, 3},
{5, 9, 8}}

Answer 1

您可以在quicksort方法中包含参数int column。

然后，您只需将每个的[x]替换为的[x][column]，而swap方法（if else with temp）保持不变。只需将temp设置为int[]，而不是int。当然，a的类型必须是int[][]而不是int[]。

完成：）