排序算法 - 交换排序 - 冒泡排序

package com;

public class InsertSort {
 
    
    public static void insertSort() {
        int [] a = {8,7,6,5};
    
        int count  =  0 ;
        int tmp = 0; 
                for(int j = 0 ; j<a.length;j++) {
                    System.out.println("当前外层"+j);
                for(int i = 1; i <a.length-j;i++)
                {
                        System.out.println(i);
                        if(a[i]<a[i-1])
                        {
                            tmp = a[i-1];
                            a[i-1]=a[i];
                            a[i]=tmp;
                            
                        }
                        
                        sout(a);
                        System.out.println();
                        count++;
                    }
                System.out.println();
                
                }

        
        System.out.println();
        System.out.println("需要执行"+count+"次");
    }
    
    
    public static void sout(int a [] ) {
        for (int i : a) {
            System.out.print(i+" , ");
        }
        
    }
    
    public static void main(String[] args) {
        insertSort();
    }

}

image.png