对比：冒泡算法和选择算法

import java.util.Arrays;

public class java_test{
    public static void main(String[] args){
            int[] bubble = {33, 27, 19, 65, 20, 5, 25, 44, 7, 13};                        
            int replace = 0;
            int f = 0;
            /* selection algorithm 
            for (int i = 0; i < (bubble.length); i++){
                    for (int j = i + 1; j < (bubble.length); j++){
                            if (bubble[i] > bubble[j]){
                                    int tmp = bubble[i];
                                    bubble[i] = bubble[j];
                                    bubble[j] = tmp;
                                    replace++;
                            }
                            f++;
                    }
            } */ 
            /* replace:29; f:45 */

            /* Bubble Sort 
            for (int i = 0; i < (bubble.length - 1); i++){
                    for (int j = 0; j < (bubble.length - 1); j++){
                            if (bubble[j] > bubble[j + 1]){
                                    int tmp = bubble[j];
                                    bubble[j] = bubble[j + 1];
                                    bubble[j + 1] = tmp;
                                    replace++;
                            }
                            f++;
                    }
            }
            /* replace:29; f:81

            for (int i = 0; i < bubble.length; i++){
                    System.out.println(bubble[i]);
            }
            System.out.println("replace: " + replace + "f: " + f)
    }
}