冒泡算法

冒泡算法

算法

def bubbling_sort(a[]) do
    for i = 1 to n-1 :
        for j = 1 to n-i :
            if a[j] > a[j+1];   
                exchange a[j] and a[j+1]
            end if
        end for
    end for         

算法测试

import java.util.Arrays;

public class Test {

    public static void main(String[] args) {
        int[] a = {1564, 223, 32343, 4342, 645, 893, 8932, 345};
        bubbling_sort(a);
        System.out.println(Arrays.toString(a));

    }

    private static void bubbling_sort(int[] array) {
        int len = array.length;
        int temp = 0;

        for (int i = 0; i < len-1; i++) {
            for (int j = 0; j < len-i-1; j++) {
                if (array[j] > array[j+1]) {
                    temp = array[j];
                    array[j] = array[j+1];
                    array[j+1] = temp;
                }
            }
        }
    }
}