#include<stdio.h>
#include<string.h>
int main()
{
int a[9];
printf("请输入学号:");
int j;
for (int j = 0; j < 8; j++)
scanf("%d", &a[j]);
int b[10];
char c[10];
printf("请输入姓名:");
scanf("%s",&c[10]);
printf("请输入班级:");
scanf("%d",&b[10]);
printf("请输入你想选择的功能:1、在学号定位删除一个数;2、在学号定位加入一个数;3、将学号从大到小排序\n");
int k;
scanf("%d", &k);
switch (k)
{
case 1:
int u,w;
printf("请输入你想删除第几位数字:\n");
scanf("%d", &u);
for (w = u ; w < 9; w++)
{
a[w-1]=a[w] ;
}
int l;
for (l = 0; l < 7; l++)
{
printf("%d", a[l]);
}
break;
case 2:
int f;
printf("请输入你想插入的数:\n");
scanf("%d", &f);
int k;
printf("请输入你想插入第几位:\n");
scanf("%d", &k);
int s;
s = a[k-1];
a[k-1] = f;
int i;
for (i = k ; i < 10; i++)
{
int d;
d = a[i];
a[i] = s;
s = d;
}
int j;
for (j = 0; j < 9; j++)
{
printf("%d", a[j]);
}
break;
case 3:
int e , t, m;
for (e = 0; e < 8; e++) {
for (m = 0; m < 8; m++) {
if (a[m] < a[m + 1]) {
t = a[m + 1]; a[m + 1] = a[m]; a[m] = t; //交换数值
}
}
} //冒泡排序排序
int n;
printf("排序后的数组是:\n");
for (n = 0; n < 8; n++)
{
printf("%d ", a[n]);
} //输出最终排序后的值
break;
}
return 0;
}