java冒泡排序算法 (转)

面试老考这个,都背熟了

 1 package  ch01;
 2
 3 public   class  BubbleSort
 4 {
 5    
 6    
 7    public static void main(String[] args){
 8        int[] values ={
 9                3,1,6,2,9,0,7,4,5
10        }
;
11        
12        sort(values);
13        for(int i=0; i < values.length; ++i){
14            
15            System.out.println("Index: " + i + "Value: " + values[i]);
16            
17        }

18        
19        
20    }

21    
22    
23    public static void sort(int[]  values){
24        
25        
26        int temp;
27        
28        for(int i=0 ; i < values.length ; ++i){
29            
30            for(int j=0; j <values.length - i - 1++j){
31                
32                if(values[j] > values[j + 1]){
33                    temp = values[j];
34                    values[j] = values[j + 1];
35                    values[j + 1= temp;
36                    
37                    
38                    
39                }

40                
41                
42                
43            }

44            
45            
46        }

47    }

48
49}

50

猜你喜欢

转载自helloworlda.iteye.com/blog/1173780