首先附上代码:
package BubbleSort;
import java.util.Scanner;
public class demo {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println("请输入需要从小到大排序的数组");
String str = input.nextLine(); //将输入的数据作为一个完整的字符串
input.close();
String[] numList = str.split("\\s"); //split("\\s")指按空格,制表符等进行拆分,并存入整型数组
for (String s : numList) {
int num = Integer.parseInt(s);
// System.out.print(num + "\t");
}
//将数组转为整形
int[] num = new int[numList.length];
for (int i = 0; i < num.length; i++) {
num[i] = Integer.parseInt(numList[i]);
}
//实现排序
for (int i = 0; i < num.length - 1; i++) {
BuuleSort(num);
}
//显示排序后的数组
for (int i = 0; i < num.length; i++) {
System.out.print(num[i] + "\t");
}
}
public static void BuuleSort(int[] arr) {
int temp;
for (int i = 0; i < arr.length - 1; i++) {
if (arr[i] > arr[i + 1]) {
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
}
}
写的比较麻烦,大佬勿喷,一切为了初学者。