冒泡排序实例

public class maoPao {public static void main(String args[]){int[] arr = {9,-7,5,3,-12,56,32,74,19,21};System.out.print("排序前的数组：");arrPrint(arr);arrSort(arr);System.out.print("排序后的数组：");arrPrint(arr);}//遍历数组函数public static void arrPrint(int[] arr){System.out.print("{");for(int i = 0; i < arr.length; i++){if(i == arr.length-1){System.out.print(arr[i]+"}\n");}else{System.out.print(arr[i]+",");}}}//排序函数public static void arrSort(int[] arr){for(int i = 0; i < arr.length-1; i++){for(int j = 0; j < arr.length-1-i; j++){swap(arr,j,j+1);}}}//单独的元素置换函数public static void swap(int[] arr, int x, int y){int temp;if(arr[x] > arr[y]){temp = arr[x];arr[x] = arr[y];arr[y] = temp;}}}