Java实现冒泡排序

package com.test;

import java.util.Arrays;

public class Test6 {

     /**      * @param args      */     public static void main(String[] args) {          // TODO Auto-generated method stub          int[] a = {1, 5 , 3, 2, 7, 9, 6, 4};          maoPao(a);          System.out.println(Arrays.toString(a));            int[] data = {14, 33, 2, 5, 4, 6, 55};          maoPao(data);          System.out.println(Arrays.toString(data));     }      /*      * 冒泡排序      */     public static void maoPao(int[] arr) {         for(int i=0; i<arr.length; i++) {             for(int j=0; j<arr.length-i-1; j++) {                 if(arr[j]>arr[j+1]) {                     int t = arr[j+1];                     arr[j+1] = arr[j];                     arr[j] = t;                 }             }         }     }   }