using System;
namespace 成绩查询
{
internal class Program
{
static void Main(string[] args)
{
int i, n, aimer;
Console.Write("欢迎使用成绩查询平台(*￣3￣)╭\n\n");
Console.Write("请输入班级人数:\n");
n = Convert.ToInt32(Console.ReadLine());//存长度
Console.WriteLine("请输入学生成绩");
#region 以空格为间隙输入
string s = Console.ReadLine();
string[] js = s.Split(" ");
double[] zjr = new double[n];
for (i = 0; i < n; i++)
{
zjr[i] = Convert.ToDouble(js[i]);
}
#endregion
do
{
Console.ForegroundColor = ConsoleColor.DarkBlue;
Console.WriteLine("*****************");
Console.ForegroundColor = ConsoleColor.Cyan;
Console.WriteLine("求最大值，请选1");
Console.ForegroundColor = ConsoleColor.Green;
Console.WriteLine("求最小值，请选2");
Console.ForegroundColor = ConsoleColor.Red;
Console.WriteLine("求平均值，请选3");
Console.ForegroundColor = ConsoleColor.White;
Console.WriteLine("升序，请选4");
Console.ForegroundColor = ConsoleColor.Yellow;
Console.WriteLine("降序，请选5");
Console.ForegroundColor = ConsoleColor.DarkMagenta;
Console.WriteLine("结束服务，请选0");
Console.ForegroundColor = ConsoleColor.DarkBlue;
Console.WriteLine("*****************\n");
Console.ForegroundColor = ConsoleColor.White;
aimer = Convert.ToInt32(Console.ReadLine());
switch (aimer)
{
case 1:min(zjr, n);
break;
case 2:
max(zjr, n);
break;
case 3:
pj(zjr, n);
break;
case 4:
jiangxu(zjr, n);
break;
case 5:
shengxu(zjr, n);
break;
case 0:
Console.WriteLine("服务结束，感谢使用");
break;
default:
Console.WriteLine("输入不合法，请重新输入");
break;
}
} while (aimer != 0);
}
public static void min(double[] zjr, int n)//求最小值
{
double m = zjr[0];
int i;
for (i = 0; i < n; i++)
{
if (m > zjr[i])
{
m = zjr[i];
}
}
Console.WriteLine("最小值="+m);
}
public static void max(double[] zjr, int n)//求最大值
{
double m = zjr[0];
int i;
for (i = 0; i < n; i++)
{
if (m < zjr[i])
{
m = zjr[i];
}
}
Console.WriteLine("最大值="+m);
}
public static void pj(double[] zjr, int n)//求平均值
{
double m = 0;
int i;
for (i = 0; i < n; i++)
{
m += zjr[i];
}
Console.WriteLine("平均值="+m);
}
public static void jiangxu(double[] zjr, int n)//降序
{
int i, j; double m;
for (j = 0; j < n; j++)
{
for (i = 0; i < n - 1; i++)
{
if (zjr[i] > zjr[i + 1])
{
m = zjr[i];
zjr[i] = zjr[i + 1];
zjr[i + 1] = m;
}
}
}
Console.WriteLine("降序结果为:");
for (i = 0; i < n; i++)
{
Console.Write(zjr[i] + " ");
}
Console.WriteLine();
}
public static void shengxu(double[] zjr, int n)//升序
{
int i, j; double m;
for (j = 0; j < n; j++)
{
for (i = 0; i < n - 1; i++)
{
if (zjr[i] < zjr[i + 1])
{
m = zjr[i];
zjr[i] = zjr[i + 1];
zjr[i + 1] = m;
}
}
}
Console.WriteLine("升序结果为:");
for (i = 0; i < n; i++)
{
Console.Write(zjr[i] + " ");
}
Console.WriteLine();
}
}
}
