题目:
程序代码:
package 冒泡算法;
import java.util.Scanner;
public class maoPao {
public static void Sort(int []Array){
for (int i = 0; i < Array.length-1; i++) {
for (int j = 0; j < Array.length-1-i; j++) {
if (Array[j]>Array[j+1]){
int t=Array[j];
Array[j]=Array[j+1];
Array[j+1]=t;
}
}
}
}
public static void PrintArray(int Array[]){
for (int i = 0; i < Array.length; i++) {
System.out.print(Array[i]+" ");
}
System.out.println();
}
public static void ScannerArray(int []Array) {
Scanner in=new Scanner(System.in);
for (int i = 0; i <Array.length; i++) {
Array[i]=in.nextInt();
}
}
public static void main(String[] args) {
int []Array1=new int[10];
System.out.println("输入数组1:");
ScannerArray(Array1);
System.out.println("输入数组2:");
int []Array2=new int[10];
ScannerArray(Array2);
System.out.println("对数组分别进行排序:");
Sort(Array1);
Sort(Array2);
System.out.println("打印排序后的数组");
System.out.println("数组1");
PrintArray(Array1);
System.out.println("数组2");
PrintArray(Array2);
int min=Array1[0]<Array2[0]?Array1[0]:Array2[0];
System.out.println("两个数组中的最小值为"+min);
}
}
运行结果: