冒泡排序

public class BubbleSort{
   

    public static void sort(int[] arr) { int temp; boolean flag = true;//排序的优化，当循环不在赋值时就会停止循环 for (int i = 0; i < arr.length -1 && flag; i++) { flag = false; // 每一次由底至上地上升 for (int j = arr.length - 1; j > i; j--) { if (arr[j] < arr[j - 1]) { temp = arr[j]; arr[j] = arr[j - 1]; arr[j - 1] = temp; flag = true; } } } } public static void print(int[] arr) { for (int i : arr) { System.out.print(i + " "); } System.out.println(); } public static void main(String[] args) { int arr[] = { 43, 37, 64, 90, 76, 11, 29, 43 }; sort(arr); print(arr); } }

转载于:https://www.cnblogs.com/sunrise88/p/6680047.html