数据结构-冒泡排序

 1 package simpleSort;
 2 /**
 3  * 冒泡排序；
 4  * @author caizhou
 5  *
 6  */
 7 public class maopao {
 8     
 9     
10     public void sort(long[] arr){
11         for (int i=0; i<arr.length-1;i++){
12             for (int j = i; j<arr.length; j++){
13                 
14                 if(arr[i]>arr[j]){
15                     long tem = arr[i];
16                     arr[i] = arr[j];
17                     arr[j] = tem;
18                 }
19             }
20         }
21     }
22 }