Java 冒泡排序代码实现 - 简单易懂
public class BubbleSort {
public static void main(String[] args) { int[] arr = {5, 3, 8, 4, 2}; bubbleSort(arr); System.out.println(Arrays.toString(arr)); }
public static void bubbleSort(int[] arr) { int n = arr.length; for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } } }
原文地址: https://www.cveoy.top/t/topic/mv2A 著作权归作者所有。请勿转载和采集!