策略模式

package com.snail.basic;

import java.util.Comparator;

public class Insertion {
    public static void sort(Object[] a, Comparator c){
        int N = a.length;
        for (int i = 1; i < N; i++) {
            for (int j = i; j >0 && less(c,a[j],a[j-1]); j--) {
                exch(a,j,j-1);
            }
        }
    }
    public static boolean less(Comparator c,Object v,Object w){
        return c.compare(v,w)<0;
    }
    public static void exch(Object[] a,int i,int j){
        Object t = a[i];
        a[i]=a[j];
        a[j]=t;
    }
    public static void main(String[] args) {
        // 随意几个对象 包含who when amount 等字段,按照不同字段排序
        Object[] a = new Object[5];
        Insertion.sort(a,new Transaction.WhoOrder());
        Insertion.sort(a,new Transaction.WnenOrder());
        Insertion.sort(a,new Transaction.HowMuchOrder());

    }
}

package com.snail.basic;

import java.util.Comparator;
import java.util.Date;

public class Transaction {
    private final String who = null;
    private final Date when = null;
    private final double amount = 0.0;
    public static class WhoOrder implements Comparator<Transaction>{
        @Override
        public int compare(Transaction v, Transaction w) {
            return v.who.compareTo(w.who);
        }
    }
    public static class WnenOrder implements Comparator<Transaction>{
        @Override
        public int compare(Transaction v, Transaction w) {
            return v.when.compareTo(w.when);
        }
    }
    public static class HowMuchOrder implements Comparator<Transaction>{
        @Override
        public int compare(Transaction v, Transaction w) {
            if(v.amount < w.amount) return -1;
            if(v.amount > w.amount) return +1;
            return 0;
        }
    }
}