//給一個(gè)integres 的數(shù)組, 然后再給個(gè) Comparator的接口 c
	/**
     *
     * @param  integers 給一個(gè) integres 的數(shù)組,作為要排序的數(shù)組
     * @param c  接受一個(gè) Comparator 接口 ,然后使用Comparator 重寫的 compare 方法
     */
 public static void bubbleSort(Integer[] integers,Comparator c ){

        int temp;
        
        for(int i = 0 ; i < integers.length-1;i++){
            for(int j = 0 ; j < integers.length -1 -i;j++){
            
			//判斷是從大到小還是從小到大
                if(c.compare(integers[j] , integers[j+1]) > 0){
                    
                    //慢
                    /*integers[j] += integers[j+1];
                    integers[j+1] = integers[j] - integers[j+1];
                    integers[j] = integers[j] - integers[j+1];*/

                    //更快
                    temp = integers[j];
                    integers[j] = integers[j+1];
                    integers[j+1] = temp;

                }
            }
        }


    }

    //第一種寫法 匿名類寫法
        bubbleSort(number, new Comparator() {
            @Override
            public int compare(Object o1, Object o2) {
                return (int)o1 - (int)o2;
            }
        });

        // 接受2個(gè)參數(shù)(數(shù)字),并返回他們的差值  
        // (x, y) -> x – y  
        //第二種寫法
        bubbleSort(number, (Object o1 ,Object o2)-> (int)o1 - (int)o2);

        /*第三種寫法
        * 1.先把Object 轉(zhuǎn)為 int 然后執(zhí)行以下操作
        * Comparator.comparingInt((Object o) -> (int) o);
        * 
        * 2.會(huì)返回 (c1, c2)  -> Integer.compare(keyExtractor.applyAsInt(c1), keyExtractor.applyAsInt(c2));
        * 會(huì)讀取兩個(gè)對(duì)象 keyExtractor.applyAsInt(c1) , keyExtractor.applyAsInt(c2)
        * 
        * 3.(Comparator.comparingInt((Object o) -> (int) o)))讀取一個(gè)(keyExtractor.applyAsInt(c1))后返回到這里(Comparator.comparingInt((Object o) -> (int) o))),然后再讀取一個(gè)(keyExtractor.applyAsInt(c2))
        * 
        * 4.兩個(gè)了之后就開(kāi)始比較Integer.compare
        * public static int compare(int x, int y) {
        *        return (x < y) ? -1 : ((x == y) ? 0 : 1);
        *    }
        *5.最后經(jīng)過(guò)三元運(yùn)算符后 返回對(duì)應(yīng)的數(shù)
        */
        
        bubbleSort(number, Comparator.comparingInt((Object o) -> (int) o));

import java.util.Arrays;
import java.util.Comparator;

public class Test {
    public static void main(String[] args) {
        Integer number[] = {1,4,2,23,32,43};
		//第一種寫法
        bubbleSort(number, new Comparator() {
            @Override
            public int compare(Object o1, Object o2) {
                return (int)o1 - (int)o2;
            }
        });
        
		//第二種寫法
        //1.先把Object 轉(zhuǎn)為 int 然后執(zhí)行以下操作
        //Comparator.comparingInt((Object o) -> (int) o);
        //2.會(huì)進(jìn)去 (c1, c2) -> Integer.compare(keyExtractor.applyAsInt(c1), keyExtractor.applyAsInt(c2));
        //然后會(huì)讀取兩個(gè)對(duì)象keyExtractor.applyAsInt(c1) , keyExtractor.applyAsInt(c2)
        //3.Comparator.comparingInt((Object o) -> (int) o)) 讀取一個(gè)后返回到這里,然后再讀取一個(gè)
        //4.兩個(gè)了之后就開(kāi)始比較Integer.compare
        // public static int compare(int x, int y) {
        //        return (x < y) ? -1 : ((x == y) ? 0 : 1);
        //    }
        //5.返回 最后的數(shù)
        bubbleSort(number, Comparator.comparingInt((Object o) -> (int) o));

		//第三種寫法
        bubbleSort(number, (Object o1 ,Object o2)-> (int)o1 - (int)o2);


        System.out.println("排序后的數(shù)組"+Arrays.toString(number));
        
   		 }
   		 

   //給一個(gè)integres 的數(shù)組, 然后再給個(gè) Comparator的接口 c
	/**
     *
     * @param  integers 給一個(gè) integres 的數(shù)組,作為要排序的數(shù)組
     * @param c  接受一個(gè) Comparator 接口 ,然后使用Comparator 重寫的 compare 方法
     */
 public static void bubbleSort(Integer[] integers,Comparator c ){

        int temp;
        
        for(int i = 0 ; i < integers.length-1;i++){
            for(int j = 0 ; j < integers.length -1 -i;j++){
            
			//判斷是從大到小還是從小到大
                if(c.compare(integers[j] , integers[j+1]) > 0){
                    
                    //慢
                    /*integers[j] += integers[j+1];
                    integers[j+1] = integers[j] - integers[j+1];
                    integers[j] = integers[j] - integers[j+1];*/

                    //更快
                    temp = integers[j];
                    integers[j] = integers[j+1];
                    integers[j+1] = temp;

                }
            }
        }


   	 }
    }