数据结构之冒泡排序
Java 代码
import java.util.Scanner;
public class BubblesSort {
public static int bubblesSort (int [] A, int N) {
int sw = 0 , tmp;
boolean flag = true ;
for (int i = 0 ; flag; i++) {
flag = false ;
for (int j = N - 1 ; j >= i + 1 ; j--) {
if (A[j] < A[j - 1 ]) {
tmp = A[j];
A[j] = A[j -1 ];
A[j - 1 ] = tmp;
flag = true ;
sw++;
}
}
}
return sw;
}
public static void main (String[] args) {
int [] A = new int [100 ];
int N, sw;
Scanner scanner = new Scanner(System.in);
N = scanner.nextInt();
for (int i = 0 ; i < N; i++) {
A[i] = scanner.nextInt();
}
sw = bubblesSort(A, N);
for (int i = 0 ; i < N; i++) {
if (i!=0 ) System.out.print(" " );
System.out.print(A[i]);
}
System.out.println();
System.out.println("排序循环次数" +sw);
}
}