冒泡排序

来源：互联网发布：hdmi网络高清传输器tx 编辑：程序博客网时间：2024/06/07 08:22

http://www.cnblogs.com/wuzhenbo/archive/2012/03/30/2423861.html

//冒泡算法1    public void bubbleSort() {        int a[] = {49, 38, 65, 97, 76, 13, 27, 49, 78, 34, 12, 64, 5, 4, 62, 99, 98, 54, 56, 17, 18, 23, 34, 15, 35, 25, 53, 51};        int temp = 0;        for (int i = 0; i < a.length - 1; i++) {            for (int j = 0; j < a.length - 1 - i; j++) {                if (a[j] > a[j + 1]) {                    temp = a[j];                    a[j] = a[j + 1];                    a[j + 1] = temp;                }            }            Log.e("maopao", "===================================");            StringBuilder sb = new StringBuilder();            for (int k = 0; k < a.length; k++) {                sb.append(a[k] + " ");            }            Log.i("maopao", sb.toString());        }    }    /**     * 对位置进行排序，每次遍历后，就把前面几个排序完成     */    public void posSort() {        int a[] = {49, 38, 65, 97, 76, 13, 27, 49, 78, 34, 12, 64, 5, 4, 62, 99, 98, 54, 56, 17, 18, 23, 34, 15, 35, 25, 53, 51};        int temp = 0;        for (int i = 0; i < a.length - 1; i++) {            for (int j = i + 1; j < a.length - 1; j++) {                if (a[i] > a[j]) {                    temp = a[i];                    a[i] = a[j];                    a[j] = temp;                }            }            Log.e("maopao", "===================================");            StringBuilder sb = new StringBuilder();            for (int k = 0; k < a.length; k++) {                sb.append(a[k] + " ");            }            Log.i("maopao", sb.toString());        }    }

阅读全文

0 0