C#之冒泡排序通用篇

主文件

using System;
using System.Text;
namespace _01
{
    class Program
    {
        static void Main(string[] args)
        {
            TestSort();//int冒泡排序
            TestComonSort();//任意类型冒泡排序
        }

        private static void TestSort()
        {
            int[] sortArray = new int[] { 123, 23, 12, 3, 345, 43, 53, 4 };
            Sort(sortArray);
            foreach (var temp in sortArray)
            {
                Console.Write(temp + " ");
            }
        }
        private static void Sort(int[] sort)
        {
            for (int i = 0; i < sort.Length - 1; i++)
            {
                for (int j = i + 1; j < sort.Length; j++)
                {
                    if(sort[i] > sort[j])
                    {
                        int temp = sort[i];
                        sort[i] = sort[j];
                        sort[j] = temp;

                    }
                }
            }
        }
        private static void TestComonSort()
        {
            Employee[] employees = new Employee[]{
                new Employee("dsf",12),
                new Employee("435dsf",234),
                new Employee("234dsf",14),
                new Employee("ds234f",234),
                new Employee("dssfdf",90)
            };
            CommonSort(employees, Employee.Compare);
            foreach (Employee em in employees)
            {
                Console.WriteLine(em.Salary);
            }
            Console.ReadKey();

        }
        /// <summary>
        /// Commons the sort.
        /// </summary>
        /// <param name="sortArray">Sort array.</param>
        /// <param name="compareMethod">Compare method.</param>
        /// <typeparam name="T">The 1st type parameter.定义范型函数</typeparam>
        private static void CommonSort<T>(T[] sortArray, Func<T,T,bool> compareMethod)
        {
            for (int i = 0; i < sortArray.Length -1; i++)
            {
                for (int j = i + 1; j < sortArray.Length; j++)
                {
                    if(compareMethod(sortArray[i], sortArray[j])){
                        T temp = sortArray[i];
                        sortArray[i] = sortArray[j];
                        sortArray[j] = temp;
                    }
                }
            }
        }

    }
}

Employee类

using System;
namespace _01
{
    /// <summary>
    /// 雇员类
    /// </summary>
    public class Employee
    {
        public string Name { get; private set; }
        public int Salary { get; private set; }

        public Employee(string name, int salary)
        {
            this.Name = name;
            this.Salary = salary;
        }

        public static bool Compare(Employee e1, Employee e2)
        {
            return (e1.Salary > e2.Salary);
        }
    }
}

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值