冒泡排序法 根据实体中的某个字段对实体 进行排序

实体:

 1 package com.kns.test;
 2 
 3 import java.util.Date;
 4 
 5 public class testClass {
 6     private String name;
 7     private Integer age;
 8     private Date date;
 9 
10     public testClass(String name, Integer age, Date date) {
11         this.name = name;
12         this.age = age;
13         this.date = date;
14     }
15 
16     public String getName() {
17         return name;
18     }
19 
20     public void setName(String name) {
21         this.name = name;
22     }
23 
24     public Integer getAge() {
25         return age;
26     }
27 
28     public void setAge(Integer age) {
29         this.age = age;
30     }
31 
32     public Date getDate() {
33         return date;
34     }
35 
36     public void setDate(Date date) {
37         this.date = date;
38     }
39 }

排序:

 1 package com.kns.test;
 2 
 3 import java.util.ArrayList;
 4 import java.util.Date;
 5 import java.util.List;
 6 
 7 public class demo3 {
 8 
 9     public static void main(String[] args) {
10         testClass a = new testClass("shaojiajia",1, new Date());
11         testClass b = new testClass("shaojiajia",17, new Date());
12         testClass c = new testClass("shaojiajia",11, new Date());
13         testClass d = new testClass("shaojiajia",19, new Date());
14         testClass e = new testClass("shaojiajia",12, new Date());
15         List<testClass> testClassList = new ArrayList<testClass>();
16         testClassList.add(a);
17         testClassList.add(b);
18         testClassList.add(c);
19         testClassList.add(d);
20         testClassList.add(e);
21         testClassList.toArray();
22 
23         Object[] testClasses = testClassList.toArray();
24         for (Object object : testClasses) {
25             testClass testClass = (testClass) object;
26             System.out.println(testClass.getAge());
27         }
28 
29         System.out.println("--------------------------------------");
30 
31         Object temp;
32         for (int i = 0; i < testClasses.length - 1; i++) {
33             for (int j = i+1; j < testClasses.length; j++) {
34                 if (((testClass)testClasses[i]).getAge() < ((testClass)testClasses[j]).getAge()) {
35                     temp = testClasses[j];
36                     testClasses[j] = testClasses[i];
37                     testClasses[i] = temp;
38                 }
39             }
40         }
41         for (Object object : testClasses) {
42             testClass testClass = (testClass) object;
43             System.out.println(testClass.getAge());
44         }
45     }
46 }

结果:

转载于:https://www.cnblogs.com/kns2017/p/7491319.html

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值