Java 的排序

下面一段程序展示了,以Book类的sellCount字段进行排序.

ListSortSellCount方法里面,
展示了三种最基本的排序算法,一共4种情况。

package book;
 
/****
 * 实体类
 * @author founder
 */
public class Book {
    private String bookSN;  //图书编号
    private int sellCount;  //销量
    public String getBookSN() {
        return bookSN;
    }
    public void setBookSN(String bookSN) {
        this.bookSN = bookSN;
    }
    public int getSellCount() {
        return sellCount;
    }
    public void setSellCount(int sellCount) {
        this.sellCount = sellCount;
    }
 
}

package book;
  
import java.util.Comparator;
  
/**
 * 比较器类,比较两个参数的大小。一般用于集合或者Map的排序。
 */
public class ComparatorBook implements Comparator<Book> {
 
    public int compare(Book o1, Book o2) {
        if(o1==null)return -1;
        if(o2==null)return 1;
        if(o1==o2)return 0;
        if(o1.getSellCount()>o2.getSellCount()){
            return 1;
        }
        if(o2.getSellCount()==o1.getSellCount()){
            return 0;
        }
        return -1;
    }
}

package book;
 
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.ListIterator;
  
public class BookDAO {
  
    /**
     * 测试用例
     */
    public static void main(String[] args) {
        Book book1 = new Book();
        book1.setBookSN("SN1");
        book1.setSellCount(101);
        Book book2 = new Book();
        book2.setBookSN("SN2");
        book2.setSellCount(102);
        Book book3 = new Book();
        book3.setBookSN("SN3");
        book3.setSellCount(103);
        Book book4 = new Book();
        book4.setBookSN("SN4");
        book4.setSellCount(100);
        List<Book> bookList = new ArrayList<Book>();
        bookList.add(book1);
        bookList.add(book2);
        bookList.add(book3);
        bookList.add(book4);
        BookDAO bookDAO = new BookDAO();
        List<Book> sorted = bookDAO.ListSortSellCount(bookList);
        for(Book book : sorted){
            System.out.println(book.getBookSN()+"\t"+book.getSellCount());
        }
    }
  
    /***************************************************************************
     * 对销量升序
     */
    public List<Book> ListSortSellCount(List<Book> bookList) {
        ComparatorBook comparator=new ComparatorBook();
        List<Book> result = null;
        result = bubbleSort(bookList);
        result = bubbleSort(bookList,comparator);
        result = selectionSort(bookList,comparator);
        result = jdkSort(bookList,comparator);
        return result;
    }
     
    public List<Book>  bubbleSort(List<Book> bookList){
        System.out.println("冒泡排序算法(不用比较器升序):");
        Book[] array = bookList.toArray(new Book[bookList.size()]);
        Book temp = null;
        for(int i=0;i<array.length;i++){
            for(int j=array.length-1;j>i;j--){
                if(array[j-1].getSellCount()>array[j].getSellCount()){
                    temp = array[j];
                    array[j] = array[j-1];
                    array[j-1] = temp;
                }
            }
        }
        ListIterator<Book> i = bookList.listIterator();
        for (int j=0; j<array.length; j++) {
            i.next();
            i.set(array[j]);
        }
        return bookList;
    }
    public List<Book>  bubbleSort(List<Book> bookList,ComparatorBook comparator){
        System.out.println("冒泡排序算法:");
        Book[] array = bookList.toArray(new Book[bookList.size()]);
        Book temp = null;
        for(int i=0;i<array.length;i++){
            for(int j=array.length-1;j>i;j--){
                if(comparator.compare(array[j-1], array[j])>0){
                    temp = array[j];
                    array[j] = array[j-1];
                    array[j-1] = temp;
                }
            }
        }
        ListIterator<Book> i = bookList.listIterator();
        for (int j=0; j<array.length; j++) {
            i.next();
            i.set(array[j]);
        }
        return bookList;
    }
    public List<Book>  selectionSort(List<Book> bookList,ComparatorBook comparator){
        System.out.println("选择排序算法:");
        Book[] array = bookList.toArray(new Book[bookList.size()]);
        int index = 0;
        Book temp = null;
        for(int i=0;i<array.length;i++){
            index = i;
            for(int j=i+1;j<array.length;j++){
                if(comparator.compare(array[index], array[j])>0){
                    index = j;
                }
            }
            temp = array[index];
            array[index] = array[i];
            array[i] = temp;
        }
        ListIterator<Book> i = bookList.listIterator();
        for (int j=0; j<array.length; j++) {
            i.next();
            i.set(array[j]);
        }
        return bookList;
    }
    public List<Book> jdkSort(List<Book> bookList,ComparatorBook comparator){
        System.out.println("JDK 排序算法:");
        Collections.sort(bookList, comparator);
        return bookList;
    }
     
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值