Sorted List Example – Simple Reverse and Comparable Sort

Simple Sorted List Example
package com.sheting.basic.collection.sorted;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class SimpleSorting {
    public static void main(String... args) {
        List<Integer> random = new ArrayList<Integer>();
        for (int i = 0; i < 10; i++) {
            random.add((int) (Math.random() * 100));
        }

        System.out.println("Initial List: " + random);

        Collections.sort(random);
        System.out.println("Sorted List: " + random);

        Collections.sort(random, Collections.reverseOrder());
        System.out.println("Reverse sorted List: " + random);
    }
}
Initial List: [66, 32, 35, 59, 86, 91, 0, 41, 24, 36]
Sorted List: [0, 24, 32, 35, 36, 41, 59, 66, 86, 91]
Reverse sorted List: [91, 86, 66, 59, 41, 36, 35, 32, 24, 0]
Comparable Sorted List Example
package com.sheting.basic.collection.sorted;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class ComparableSorting {
    public static void main(String... args) {
        List<Integer> random = new ArrayList<Integer>();
        for (int i = 0; i < 10; i++) {
            random.add((int) (Math.random() * 100));
        }

        System.out.println("Initial List: " + random);
        Collections.sort(random, new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return (o1 > o2) ? 1 : -1;
            }
        });
        System.out.println("Sorted List: " + random);

        Collections.sort(random, new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return (o1 < o2) ? 1 : -1;
            }
        });
        System.out.println("Reversed Sorted List: " + random);
    }
}
Initial List: [87, 72, 8, 56, 38, 14, 76, 23, 30, 64]
Sorted List: [8, 14, 23, 30, 38, 56, 64, 72, 76, 87]
Reversed Sorted List: [87, 76, 72, 64, 56, 38, 30, 23, 14, 8]
Java 8 Lambda Sorted List Example
package com.sheting.basic.collection.sorted;

import java.util.ArrayList;
import java.util.List;

public class LambdaSorting {
    public static void main(String... args) {
        List<Integer> random = new ArrayList<Integer>();
        for (int i = 0; i < 10; i++) {
            random.add((int) (Math.random() * 100));
        }

        System.out.println("Initial List: " + random);

        random.sort((a, b) -> (a - b));
        System.out.println("Sorted List: " + random);

        random.sort((a, b) -> (b - a));
        System.out.println("Reverse Sorted List: " + random);
    }
}
Initial List: [92, 78, 26, 37, 1, 12, 50, 90, 7, 15]
Sorted List: [1, 7, 12, 15, 26, 37, 50, 78, 90, 92]
Reverse Sorted List: [92, 90, 78, 50, 37, 26, 15, 12, 7, 1]
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值