冒泡排序选择排序

package com.itheima;

/**

* 冒泡排序，选择排序

*/

public class Test {

public static void main(String[] args) {

int[] i = { 1, 5, 6, 12, 4, 9, 3, 23, 39, 403, 596, 87 };

System.out.println("----冒泡排序的结果：");

maoPao(i);

System.out.println();

System.out.println("----选择排序的结果：");

xuanZe(i);

}

// 冒泡排序

public static void maoPao(int[] x) {

for (int i = 0; i < x.length; i++) {

for (int j = i + 1; j < x.length; j++) {

if (x[i] > x[j]) {

int temp = x[i];

x[i] = x[j];

x[j] = temp;

}

}

}

for (int i : x) {

System.out.print(i + " ");

}

}

// 选择排序

public static void xuanZe(int[] x) {

for (int i = 0; i < x.length; i++) {

int lowerIndex = i;

// 找出最小的一个索引

for (int j = i + 1; j < x.length; j++) {

if (x[j] < x[lowerIndex]) {

lowerIndex = j;

}

}

// 交换

int temp = x[i];

x[i] = x[lowerIndex];

x[lowerIndex] = temp;

}

for (int i : x) {

System.out.print(i + " ");

}

}