常见排序算法(Java版)
1.冒泡排序
package Sort; import java.util.Arrays; public class BubbleSort { public static void main(String[] args) { int [] a = {6, 3, 7, 2, 4, 9, 5, 8}; bubbleSort(a); for (int i=0;i<A.length-1;i++) { System.out.print(A[i]); } System.out.println(); } public static int[] bubbleSort(int[] A) for (int i=0;i<A.length-1;i++){ for (int j=i+1;j<A.length;j++){ if (A[i] > A[j]){ int tmp = A[i]; A[i] = A[j