冒泡排序: package com.it.test; //冒泡排序 public class maopao { public static void maopao_sort(int[] a) { int temp = 0; for (int i = 0; i < a.length - 1; i++) { for (int j = 0; j < a.length - i - 1; j++) { //交换 if (a[j] > a[j + 1]) { temp = a[j]; a[j] = a[j + 1]; a[j + 1] = temp; } } } print(a); } //打印 private static void print(int[] a) { for(int i=0;i<a.length;i++) { System.out.print(a[i]+"\t"); } } public static void main(String[] args) { int[] a = { 1, 4, 6, 2, 0, 3, 5, 8, 10 }; System.out.print("排序前:\t"); print(a); System.out.println(); System.out.print("排序后:\t"); maopao_sort(a); } } 运行结果: