package arithmetic;
import java.util.Arrays;
public class CompareDemol {
public static void main(String[] args) {
Integer i1 = 1;
Integer i2 = 2;
System.out.println(i1.compareTo(i2));// 比较数值大小
Character c1 = 'a';
Character c2 = 'b';
System.out.println(c1.compareTo(c2));// 比较UNICODE码
String str1 = "abc";
String str2 = "abc123";
System.out.println(str1.compareTo(str2));// 如果一个字符串是另一个字符串的字串,返回长度差
String str3 = "bc";
String str4 = "zbc";
System.out.println(str3.compareTo(str4));// 如果一个字符串是另一个字符串的字串,返回长度差
String str5 = "asd";
String str6 = "czx";
System.out.println(str5.compareTo(str6));// 如果不是字串,比较不同字符的UNICODE之差
}
public static void main1(String[] args) {
// 利用冒泡法实现排序
String[] arr = {"a","abc","abcd","bcd","ccc"};
boolean b = true;
for (int k = 0; k < arr.length - 1; k++) {
b = true;// 假设一趟开始前就是顺序的
// 选出最大值排到后面需要比较的次数
for (int i = 0; i < arr.length - 1 - k; i++) {
if (arr[i] .compareTo(arr[i + 1]) > 0) {
String temp ="";
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
b = false;
}
}
// 一趟下来没交换则停止接下来的趟数
if (b) {
break;
}
}
System.out.println(Arrays.toString(arr));
}
}
深入理解:http://www.cnblogs.com/xiaomiganfan/p/5390252.html
package arithmetic;
import java.util.Arrays;
import java.util.List;
public class SortUtil {
//数组排序
public static void sort(Object[] arr){
boolean b = true;
for(int k= 0;k <arr.length-1;k++) {
b = true;//假设一趟开始前就是顺序的
//选出最大值排到后面需要比较的次数
for(int i = 0;i < arr.length-1-k;i++) {
//能使用compareTo方法的类必然实现了Comparable接口
if((((Comparable)arr[i]).compareTo((Comparable)arr[i+1])>0)) {
Object temp;
temp = arr[i];
arr[i] = arr[i+1];
arr[i+1]=temp;
b = false;
}
}
//一趟下来没交换则停止接下来的趟数
if(b) {
break;
}
}
System.out.println(Arrays.toString(arr));
}
public static <T extends Comparable<T>> void sort(T[] arr){
boolean b = true;
for(int k= 0;k <arr.length-1;k++) {
b = true;//假设一趟开始前就是顺序的
//选出最大值排到后面需要比较的次数
for(int i = 0;i < arr.length-1-k;i++) {
if(arr[i].compareTo(arr[i+1])>0) {
T temp;
temp = arr[i];
arr[i] = arr[i+1];
arr[i+1]=temp;
b = false;
}
}
//一趟下来没交换则停止接下来的趟数
if(b) {
break;
}
}
System.out.println(Arrays.toString(arr));
}
//容器排序,转成数组,利用数组的排序方法,然后再把值放进容器里
public static <T> void sort1(List<T> list) {
Object[] obj = list.toArray();
sort(obj);
for(int i = 0;i < obj.length;i++) {
list.set(i,(T)obj[i]);
}
}
public static void main(String[] args) {
//int[] arr = {15,36,10,28,96,33,66,88,12,69};
Integer[] arr = {15,36,10,28,96,33,66,88,12,69};
sort(arr);
String[] arr1 = {"a","abc","abcd","bcd","ccc"};
sort(arr1);
}
}
package knowledgepoint;
import java.util.Arrays;
import java.util.Comparator;
//使用Comparator接口实现排序
public class ComparatorDemol {
public static void main(String[] args) {
//int[] arr1 = {15,36,10,28,96,33,66,88,12,69};
//sort(arr1, new SortString());
String[] arr = {"a","abc","abcd","bcd","ccc"};
sort(arr, new SortString());
}
public static void sort(Object[] arr, Comparator com) {
boolean b = true;
for (int k = 0; k < arr.length - 1; k++) {
b = true;// 假设一趟开始前就是顺序的
// 选出最大值排到后面需要比较的次数
for (int i = 0; i < arr.length - 1 - k; i++) {
// 能使用compareTo方法的类必然实现了Comparable接口
if (com.compare(arr[i], arr[i + 1]) > 0) {
Object temp;
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
b = false;
}
}
// 一趟下来没交换则停止接下来的趟数
if (b) {
break;
}
}
System.out.println(Arrays.toString(arr));
}
}
class SortString implements Comparator<String> {
@Override
public int compare(String o1, String o2) {
// 与String内置定义的排序规则不同
return o1.length() - o2.length();
}
}
package knowledgepoint;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
public class User_defined_Sort {
public static void main(String[] args) {
List<News> list = new ArrayList<>();
list.add(new News("abc",1000));
list.add(new News("def", 500));
list.add(new News("adv", 3000));
//Collections.sort(list);//sort的第一种使用方法,需要元素实现Comparable接口
System.out.println(list);
Collections.sort(list, new MyComparator());//sort的第一种使用方法,传入比较器
System.out.println(list);
}
}
class News implements Comparable<News>{
String title;
int hits;
public News(String title,int hits) {
this.title = title;
this.hits = hits;
}
@Override
public int compareTo(News o) {
return (this.hits - o.hits)==0?this.title.compareTo(o.title):this.hits - o.hits;
}
@Override
public String toString() {
return "标题"+this.title+"点击量"+this.hits;
}
}
//此种方法需要有比较器
class MyComparator implements Comparator<News>{
@Override
public int compare(News o1, News o2) {
return (o1.hits-o2.hits)==0?o1.title.compareTo(o2.title):o1.hits-o2.hits;
}
}