冒泡排序算法-java代码
package com.summer;
import java.util.Arrays;
import java.util.Random;
public class Buuble {
public static void main(String[] args) {
int[] arr = new int[10];
Random random = new Random();
for (int i = 0; i < 10; i++) {
int rnumber =random.nextInt(99)+1;
arr[i]=rnumber;
}
System.out.println(Arrays.toString(arr));
System.out.println("---".repeat(20));
for (int i = 0; i < arr.length-1; i++) {
for (int j = 0; j < arr.length-i-1; j++) {
if (arr[j]>arr[j+1]){
int temp;
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
System.out.println(Arrays.toString(arr));
}
}