Algorithm - Swap Sort（Java）

￡神魔★判官ぃ 2022-05-23 06:39 189阅读 0赞

分享一个大牛的人工智能教程。零基础！通俗易懂！风趣幽默！希望你也加入到人工智能的队伍中来！请点击[http://www.captainbed.net][http_www.captainbed.net]

package chimomo.learning.java.algorithm.sort;
    
    import java.util.Arrays;
    
    /**
     * @author Chimomo
     *
     * <p>
     * Introduction:
     *
     * In programming design, swap sort is one of basic sorting algorithms.
     * So-called swapping,
     * is swapping the position of two records by comparing their key.
     * </p>
     *
     * <p>
     * Basic Thought:
     *
     * The trait of swap sort is:
     * Move the record whose key is bigger towards the rear of sequence
     * and move the record whose key is smaller to the front of sequence.
     * </p>
     */
    public class SwapSort {
    
        /**
         * Swap Sort
         *
         * @param a The array to be sorted
         */
        private static void swapSort(int[] a) {
            for (int i = 0; i < a.length - 1; i++) {
                for (int j = i + 1; j < a.length; j++) {
                    if (a[i] > a[j]) {
                        int t = a[i];
                        a[i] = a[j];
                        a[j] = t;
    
                        // Print each round of sorting result
                        System.out.println(Arrays.toString(a));
                    }
                }
            }
        }
    
        /**
         * Test program
         *
         * @param args The arguments
         */
        public static void main(String[] args) {
            int[] arr = {11, 16, 22, -3, 99, 0, 16, 6, -1, 99};
    
            System.out.println("Before swap sort:");
            System.out.println(Arrays.toString(arr));
    
            System.out.println("In swap sort:");
            SwapSort.swapSort(arr);
    
            System.out.println("After swap sort:");
            System.out.println(Arrays.toString(arr));
        }
    
    }
    
    /* ------ Running Results ------
    Before swap sort:
    [11, 16, 22, -3, 99, 0, 16, 6, -1, 99]
    In swap sort:
    [-3, 16, 22, 11, 99, 0, 16, 6, -1, 99]
    [-3, 11, 22, 16, 99, 0, 16, 6, -1, 99]
    [-3, 0, 22, 16, 99, 11, 16, 6, -1, 99]
    [-3, -1, 22, 16, 99, 11, 16, 6, 0, 99]
    [-3, -1, 16, 22, 99, 11, 16, 6, 0, 99]
    [-3, -1, 11, 22, 99, 16, 16, 6, 0, 99]
    [-3, -1, 6, 22, 99, 16, 16, 11, 0, 99]
    [-3, -1, 0, 22, 99, 16, 16, 11, 6, 99]
    [-3, -1, 0, 16, 99, 22, 16, 11, 6, 99]
    [-3, -1, 0, 11, 99, 22, 16, 16, 6, 99]
    [-3, -1, 0, 6, 99, 22, 16, 16, 11, 99]
    [-3, -1, 0, 6, 22, 99, 16, 16, 11, 99]
    [-3, -1, 0, 6, 16, 99, 22, 16, 11, 99]
    [-3, -1, 0, 6, 11, 99, 22, 16, 16, 99]
    [-3, -1, 0, 6, 11, 22, 99, 16, 16, 99]
    [-3, -1, 0, 6, 11, 16, 99, 22, 16, 99]
    [-3, -1, 0, 6, 11, 16, 22, 99, 16, 99]
    [-3, -1, 0, 6, 11, 16, 16, 99, 22, 99]
    [-3, -1, 0, 6, 11, 16, 16, 22, 99, 99]
    After swap sort:
    [-3, -1, 0, 6, 11, 16, 16, 22, 99, 99]
    
    */

[http_www.captainbed.net]: http://www.captainbed.net/troubleshooter