冒泡排序

来源：互联网发布：c语言杨辉三角流程图编辑：程序博客网时间：2024/06/06 23:48
package sort;public class BubbleSort1 {    public static void BubbleSort(int array[]){        for(int i = array.length-1;i > 0;i--){            for(int j = 0;j < i;j++){                if(array[j] > array[j+1]){                    int temp = array[j];                    array[j] = array[j+1];                    array[j+1] = temp;                }            }        }    }    public  static void BubbleSort2(int array[]){        for(int i = 0;i < array.length - 1;i++)            for(int j = 0;j < array.length - 1 - i;j++)                if(array[j] > array[j+1]){                    int temp = array[j];                    array[j] = array[j+1];                    array[j+1] = temp;                }    }    public static void main(String[] args) {        int array[] = {19, 17, 16, 12, 9, 15, 1, 2, 11, 7, 3, 10, 14};        BubbleSort(array);        for(int i=0;i<array.length;i++){            System.out.print(array[i]+" ");        }        System.out.println();        int array2[] = {19, 17, 16, 12, 9, 15, 1, 2, 11, 7, 3, 10, 14};        BubbleSort2(array2);        for(int i=0;i<array.length;i++){            System.out.print(array2[i]+" ");        }    }}
0 0