for(int i=2;i<=100;i++){
boolean x=false; //标识 用来记录最初的状态
for(int j=2;j<=i/2;j++){
if(i%j= =0){
System.out.println(i+“不是素数”);
x=true; //状态改变 所以不是素数
break;
}
}
if(!x){ //x==false 可以换成 !x 结果都是true
System.out.println(i+“是素数”);
}
}
2.升序
int[] num = { 16, 25, 9, 90, 23 };
for (int i = 0; i < num.length; i++) {
for (int j = 0; j < num.length - 1 - i; j++) {
if (num[j] > num[j + 1]) {
int max = num[j];
num[j] = num[j + 1];
num[j + 1] = max;
}
}
}
3.向一组数组新增成绩
int[] score = { 99, 85, 82, 63, 60 };
int[] score2 = new int[score.length + 1];
Scanner input = new Scanner(System.in);
System.out.println(“请输入新增的成绩:”);
int temp = input.nextInt();
int index = -1;
for (int i = 0; i < score.length; i++) {
if (temp > score[i]) {
index = i;
break;
}
}
System.out.println(“插入成绩的下标是:” + index);
for (int i = 0; i < score.length; i++) {
score2[i] = score[i];
}
for (int i = score2.length - 2; i >= index; i–) {
score2[i + 1] = score2[i];
}
score2[index] = temp;
System.out.println(“插入后的成绩信息是:”);
for (int v : score2) {
System.out.print(v + “\t”);
}
package cn.kgc.kgc67;
import java.util.Scanner;
public class Demo01 {
// int [] a=new int[]{100,85,90,95,80,0} 使用冒泡排序
public static void main(String[] args) {
int[] a = new int[] { 100, 85, 90, 95, 80, 0 };
for (int i = 0; i < a.length-1; i++) {
for (int j = 0; j < a.length - 1 - i; j++) {
if(a[j+1]==0){
continue;
}
if (a[j] > a[j + 1]) {
int max = a[j];
a[j] = a[j + 1];
a[j + 1] = max;
}
}
}
Scanner input = new Scanner(System.in);
System.out.print(“请输入一个整数:”);
int temp = input.nextInt();
int index = -1;
for (int i = 0; i < a.length; i++) {
if (temp < a[i]) {
index = i;
break;
}
}
System.out.println(“新增数的下标是:” + index);
for (int i = a.length-2; i >=index; i–) {
a[i + 1]=a[i];
}
a[index] = temp;
System.out.println(“新增排序后的数组是:”);
for (int v : a) {
System.out.print(v + “\t”);
}
}
}