冒泡排序，选择排序

<pre name="code" class="java"><span style="font-size:24px;">package shuzu;import java.util.Arrays;public class Sort {public static void main(String[] args) {// 从小到大int a[] = { 5, 6, 4, 2, 9, 1, 10 };maoPaoSort(a);selectSort(a);}private static void selectSort(int[] a) {int temp = 0;for (int i = 0; i < a.length - 1; i++) {int index = i;for (int j = i; j < a.length; j++) {if (a[index] > a[j]) {index = j;// 后面的值小}}if (index != i) {temp = a[i];a[i] = a[index];a[index] = temp;}}for (int i = 0; i < a.length; i++) {System.out.println(a[i]);}}/** * 选择排序 */private static void selectPao(int[] a) {System.out.println(Arrays.toString(a));int temp = 0;int index = 0;for (int i = 0; i < a.length - 1; i++) {index = i;// 保留下标for (int j = i; j < a.length; j++) {if (a[index] > a[j]) {index = j;// 后边的值小，将下标重新设定}}if(index!=i){//满足条件再换，不满足不执行index==i满足排序节省效率temp = a[i];a[i] = a[index];a[index] = temp;}}System.out.println(Arrays.toString(a));}/** * 冒泡排序 *  * @param a */private static void maoPaoSort(int[] a) {int temp = 0;for (int i = 0; i < a.length - 1; i++) {for (int j = i + 1; j < a.length; j++) {if (a[j] < a[i]) {// 判断前一个数是否比后一个数大，如果大的话，两个数交换位置temp = a[i];a[i] = a[j];a[j] = temp;}}}// 遍历输出for (int i : a) {System.out.print(i + ",");}System.out.println();}}</span>