Java 实现冒泡算法：从原数组到有序数组的完整代码示例

```java public class BubbleSort { public static void main(String[] args) { int[] arr = {64, 34, 25, 12, 22, 11, 90}; System.out.println("Original Array: "); printArray(arr); bubbleSort(arr); System.out.println("Sorted Array: "); printArray(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; } } } } public static void printArray(int[] arr) { for (int i=0; i<arr.length; i++) { System.out.print(arr[i] + " "); } System.out.println(); } } ``` ######[AI写代码神器 | 578点数解答 | 2024-06-11 23:07:50]