public static void main(String[] args) {
int[] score ={99,85,82,63,60};
int[] newScore = new int[score.length+1];
System.out.print("请输入新增成绩:");
Scanner stu = new Scanner(System.in);
int newStu = stu.nextInt();
for(int i=0;i<score.length;i++)
{
newScore[i] = score[i];
}
newScore[newScore.length-1] = newStu;
for(int i =0 ; i<newScore.length-1 ; i++)
{
for(int j=0 ; j<newScore.length-1-i ; j++)
{
if(newScore[j]<newScore[j+1])
{
int flag = newScore[j];
newScore[j]=newScore[j+1];
newScore[j+1]=flag;
}
}
}
for(int a=0;a<newScore.length;a++)
{
if(newScore[a]==newStu)
{
System.out.println("插入成绩的位置是:"+(a+1));
}
}
System.out.println("插入后的成绩信息是:");
for(int b=0;b<newScore.length;b++)
{
System.out.print(newScore[b]+" ");
}
}
执行结果:
通过修改冒泡排序中判断条件,实现了降序与升序的改变:
for(int i =0 ; i<newScore.length-1 ; i++)
{
for(int j=0 ; j<newScore.length-1-i ; j++)
{
if(newScore[j]<newScore[j+1]) //若要修改为升序则反过来
{
int flag = newScore[j];
newScore[j]=newScore[j+1];
newScore[j+1]=flag;
}
}
}