各种排序算法的积累

1.首先冒泡排序

import java.lang.reflect.Array;import java.util.Arrays;import java.util.Random;/** * 各种排序的算法之冒泡 * @author COSTA01 * */public class Sort {public static void main(String[] args) {//1.冒泡排序int arr[] = new int[10];for(int i=0;i<arr.length;i++){Random random = new Random();arr[i]=random.nextInt(100);}System.out.println(Arrays.toString(arr));//冒泡排序System.out.println("-----------冒泡开始----------");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 t=arr[j];arr[j] =arr[j+1];arr[j+1] =t;}System.out.println(Arrays.toString(arr));}System.out.println("-----------冒泡结束------------");System.out.println(Arrays.toString(arr));}