中文XML论坛--大家看看这道题怎么解(ds)

贴子主题：大家看看这道题怎么解(ds)

本主题类别:

public void swap(int[] array, int i, int j) {
        int temp = array[i];
        array[i] = array[j];
        array[j] = temp;
    }

    public void merge(int a[]) {
        int length = a.length;
        int start2 = 0;
        int start3 = length / 2;
        int start4 = length / 2;

        while (length > 1 && start4 < a.length) {
            int theSmallestOf3 = theSmallestOf3(a, start2, start3, start4);
            if (theSmallestOf3 == start2) {
                start2++;
            } else if (theSmallestOf3 == start4) {
                swap(a, start2, start4);
                start4++;
                start2++;
            } else {
                int temp = a[start2];
                a[start2] = a[start3];
                start2++;
                for (int i = start3; i < start4; i++) {
                    a[i] = a[i + 1];
                }
                a[start4 - 1] = temp;
            }
            if(start2 == start3){
                start3 = start4;
                length = a.length - start2;
            }
        }
    }

    public int theSmallestOf3(int a[], int start2, int start3, int start4) {
        int min = start2;
        if (a[min] > a[start3])
            min = start3;
        if (a[min] > a[start4])
            min = start4;
        return min;
    }


	W 3 C h i n a ( since 2003 ) 旗下站点苏ICP备05006046号《全国人大常委会关于维护互联网安全的决定》《计算机信息网络国际联网安全保护管理办法》	125.000ms