C# 排序的多种实现方式(经典)

一、 对数组进行排序

最常见的排序是对一个数组排序,比如:

 int[] aArray = new int[8] { 18, 17, 21, 23, 11, 31, 27, 38 };

 1、利用冒泡排序进行排序:

(即每个值都和它后面的数值比较,每次拿出最小值)


static void Main(string[] args)
        {
            int[] aArray = new int[8] { 18, 17, 21, 23, 11, 31, 27, 38 };
            for (int j = 0; j < aArray.Length - 1; j++)
            {
                for (int i = 0; i < aArray.Length - 1; i++)
                {
                    if (aArray[i] > aArray[i + 1])
                    {
                        int temp = aArray[i];
                        aArray[i] = aArray[i + 1];
                        aArray[i + 1] = temp;
                    }

                }
            }


            foreach (var a in aArray)
            {
                Console.Write($"{a} ");
            }
            Console.ReadKey();
        }

运行结果:

2、利用Array.Sort排序:

1升序
 static void Main(string[] args)
        {
            int[] aArray = new int[8] { 18, 17, 21, 23, 11, 31, 27, 38 };
            Array.Sort(aArray);

            foreach (var a in aArray)
            {
                Console.Write($"{a} ");
            }
            Console.ReadKey();
        }

运行结果:

2降序:

 先升序排列,然后对数组反转

 static void Main(string[] args)
        {
            int[] aArray = new int[8] { 18, 17, 21, 23, 11, 31, 27, 38 };
            Array.Sort(aArray);//数组排序(默认升序)
            Array.Reverse(aArray);//数组反转

            foreach (var a in aArray)
            {
                Console.Write($"{a} ");
            }
            Console.ReadKey();
        }

运行结果:

二、对List进行排序

  大多数时候,我们需要将list集合里面的数据进行排序,

1、利用List<T> 自带的Sort排序方法 

    1 、升序排序

 aList.Sort();
2、降序排序
  aList.Sort();//升序
  aList.Reverse();//反转
3 sort也可以用如下方式操作:

list.Sort((a, b) => a.CompareTo(b));//升序
list.Sort((a, b) => b.CompareTo(a));//降序

2、利用List的OrderBy与OrderByDescending方法

    升序排列:

  List<int> aList = new List<int> { 18, 17, 21, 23, 11, 31, 27, 38 };
  aList = aList.OrderBy(a => a).ToList();
降序排列:
 List<int> aList = new List<int> { 18, 17, 21, 23, 11, 31, 27, 38 };
  aList = aList.OrderByDescending(a => a).ToList();
利用link,这种感觉和方法二是一回事
List<int> aList = new List<int> { 18, 17, 21, 23, 11, 31, 27, 38 };
 aList = (from a in aList orderby a ascending select a).ToList();//升序
 aList = (from a in aList orderby a descending select a).ToList();//降序

如果集合里存放的是一个类型,比如:

学生类:

 public class Student
        {
            public string name { get; set; }
            public int age { get; set; }
            public int score { get; set; }

            public override string ToString()
            {
                return $"姓名是:{name},年龄是:{age},得分是:{score}";
            }
        }

方法一:stuList.Sort((x, y) => x.score.CompareTo(y.score));

static void Main(string[] args)
        {
            List<Student> stuList = new List<Student>
            {
                new Student() {name = "zyr", age = 23, score = 99},
                new Student() {name = "zls", age = 25, score = 95},
                new Student() {name = "zsq", age = 27, score = 100},
                new Student() {name = "zlw", age = 15, score = 69},
                new Student() {name = "ywe", age = 17, score = 72},
                new Student() {name = "asw", age = 29, score = 58}
            };

            //方法1 升序
            //stuList.Sort((x, y) => x.score.CompareTo(y.score));
     
            stuList = stuList.OrderBy(stu=>stu.score).ToList();

            foreach (var stu in stuList)
            {
                Console.WriteLine($"{stu}");
            }
            Console.ReadKey();
        }

方法二: 加入这个学生成绩有重复的,对于重复的成绩按照年龄再排序:
 方法1 升序
            stuList.Sort((x, y) =>
            {
                int ret = x.score.CompareTo(y.score);
                if (ret == 0)
                {
                    return x.age.CompareTo(y.age);
                }
                else
                {
                    return ret;
                }
            });
            方法2 升序
            stuList = stuList.OrderBy(stu => stu.score).ThenBy(stu => stu.age).ToList();

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值