java的冒泡排序

public interface Sorter{
public <T extends Comparable<T>> void sort(T[] list);
//定义两个待排序的集合

}

public class bubblie implements Sorter{
public <T extends Comparable<T>> void sort(T[] list){

boolean flag = true;
for(int i = 1,len = list.length;i<len&&flag;++i){
flag = false;
for(int j =0; j<len-1;++j){
if(list[j].compareTo(list[j + 1])>0){
T temp = list[j];
list[j] = list[j +1];
list[j +1] = temp;
flag = true;
}
}
}
}


}

posted @ 2018-01-06 21:15  IT筱龙  阅读(170)  评论(0编辑  收藏  举报