日撸java_day47

第 47 天: 选择排序

  /**
     * Selection sort.
     */
    public void selectionSort() {
        DataNode tempNode;
        int tempIndexForSmallest;
        for (int i = 0; i < length - 1; i++) {
            tempNode = data[i];
            tempIndexForSmallest = i;
            for (int j = i; j < length; j++) {
                if (tempNode.key > data[j].key) {
                    tempNode = data[j];
                    tempIndexForSmallest = j;
                }// Of if
            }// Of for j
            data[tempIndexForSmallest] = data[i];
            data[i] = tempNode;
        }// Of for i
    }// Of selectionSOrt

    /**
     * Test unit.
     */
    public static void selectionSortTest() {
        int[] tempUnsortedKeys = {5, 3, 6, 10, 7, 1, 9};
        String[] tempContents = {"if", "then", "else", "switch", "case", "for", "while"};
        DataArray tempDataArray = new DataArray(tempUnsortedKeys, tempContents);

        System.out.println(tempDataArray);

        tempDataArray.selectionSort();
        System.out.println("Result\r\n" + tempDataArray);
    }// Of selectionSortTest