冒泡排序

foreach (int a in shuzu)//遍历数组
{
Console.WriteLine(a);
}

// object 所有类的基类,可以接收任何数据类型
object a = 1;
object b = "123";
object c = true;
object d = 3.14;

输入人数,输入每个人的成绩
需要最高分,最低分
去掉两个最高分,去掉两个最低分,求平均分

            double z;
            double g = 0;
            Console.Write("输入班级人数:");
            int a = int.Parse(Console.ReadLine());
            double[] b = new double[a];
            for (int i = 0; i < a; i++)
            {
                Console.Write("请输入第" + (i + 1) + "个人的成绩:");
                b[i] = double.Parse(Console.ReadLine());
                g += b[i];
            }
            for (int i = 0; i < a; i++)
            {
                for (int j = i; j < a - 1; j++)
                {
                    if (b[i] < b[j + 1])
                    {
                        z = b[i];
                        b[i] = b[j + 1];
                        b[j + 1] = z;
                    }
                }
            }

            Console.WriteLine("最高分是:" + b[0] + ",最低分是:" + b[a - 1]);
            Console.WriteLine("平均分是:" + ((g - b[0] - b[1] - b[a - 1] - b[a - 2]) / (a - 4)));
原文地址:https://www.cnblogs.com/zbxiaoxu/p/5272262.html