package com.threeday.test;
/1)定义一个数组,int类型,长度为7,存储分数(1分)
2)从键盘输入7个学生分数,存入数组(2分)
3)从键盘录入要查找的分数,调用方法public int search(int [] arr,int elem)遍历数组进行查找,查找第一个匹配的分数,给出查找结果是否找到(4分)
4)对数组分数进行冒泡排序,从低到高排列(5分)/
import java.util.Scanner;
public class TestHomeWork1 {
static Scanner input = new Scanner(System.in);
public static void main (String [] args){
int [] numArr =new int[7];
for(int i=0;i<numArr.length;i++){
System.out.println("请输入第"+(i+1)+"个学生的成绩");
int choice = input.nextInt();
numArr[i] = choice;//把输入的成绩放到数组里
}
//冒泡排序
for(int i=0;i<numArr.length-1;i++){
boolean flag = true;//默认是有序
for (int j=0;j<numArr.length-1-i;j++){
if (numArr[j]>numArr[j+1]){
int temp;
temp = numArr[j];
numArr[j] = numArr[j+1];
numArr[j+1] = temp;
flag = false;//发生交换就是无序
}
}
if (flag){
break;
}
}
//排序完输出
for (int newArr:numArr){
System.out.print(newArr+"\t");
}
System.out.println("\n请输入要查找的分数:");
int score = input.nextInt();
search(numArr,score);
}
//判断是否存在
public static int search(int [] numArr,int score){
boolean flag = false;//默认不存在
for (int numArr1:numArr){
if (numArr1==score){
flag = true;//相等就存在
break;
}
}
if(flag){
System.out.println("存在");
}else{
System.out.println("不存在");
}
return score;
}
}